Bollobás and Nikiforov conjectured that for any graph $G \neq K_n$ with $m$ edges \[ λ_1^2+λ_2^2\le \bigg( 1-\frac{1}{ω(G)}\bigg)2m\] where $λ_1$ and $λ_2$ denote the two largest eigenvalues of the adjacency matrix $A(G)$, and $ω$ denotes the clique number of $G$. This conjecture was recently verified for triangle-free graphs by Lin, Ning and Wu and for regular graphs by Zhang. Elphick, Wocjan and Linz proposed a generalization of this conjecture. In this note, we verify this generalized conjecture for the family of graphs on $m$ edges, which contain at most $O(m^{1.5-\varepsilon})$ triangles for some $\varepsilon > 0$. In particular, we show that the conjecture is true for planar graphs, book-free graphs and cycle-free graphs.
著名的曼特尔定理指出,一个图的$n$顶点和$m$边包含一个三角形,如果$m>\frac{n^2}{4}$。Nosal证明了当谱半径为$λ_1>\sqrt{m}$时,$m$边上的每个图都包含一个三角形,这是Mantel定理的谱模拟。利用Motzkin-Straus不等式,Nikiforov改进了Nosal的结果,刻画了等式成立时的极图.本文的第一个贡献是对Nikiforov的谱简明Mantel定理给出了两个新的证明(不用Motzkin-Straus不等式)。Nikiforov还得到了一些关于连续循环和谱半径的存在性的结果。其次,我们证明了一个关于连续偶圈存在性和谱半径的定理,改进了Nikiforov的一个结果。最后,我们讨论了谱半径不等式。洪证明了他著名的谱半径界。后来,洪、舒和方将洪的界推广到了具有给定最小度的连通图。通过使用完全不同的技术,Nikiforov证明了Hong et al.的界独立于一般图。本文利用Nikiforov技巧证明了一个新的谱不等式。我们的结果推广了Stanley的谱不等式。
Some Turán-type results for the signless Laplacian spectral radius
School of Mathematics and Statistics, Jiangxi Normal University(江西师范大学数学与统计学院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);School of Mathematical Sciences, Anhui University(安徽大学数学科学学院)
Edge-spectral supersaturation and stability: Resolving a problem on color-critical subgraphs
School of Mathematics, East China University of Science and Technology(华东理工大学数学学院);School of Mathematics and Finance, Chuzhou University(滁州学院数学与金融学院);School of Mathematics and Statistics, Nanjing University of Science and Technology(南京理工大学数学与统计学院)
从$n$顶点上的完全图开始,重复删除均匀选择的三角形的边。这个随机过程一旦到达一个无三角形图就终止了,基本问题是估计最终的边数(相当于完成这个过程所需的时间,或者通过随机贪婪算法打包了多少个边不相交的三角形)。Bollobás和Erdás(1990)在对Ramsey数$R(3,t)$的研究的启发下,证明了期望的最终边数具有$n^{3/2}$阶。$o(n^2)$的上界由Spencer(1995)给出,Rödl和Thoma(1996)独立给出。对于变体和推广给出了几个界限(例如,Alon,Kim and Spencer(1997)and Wormald(1999)),而Bollobás和Erdós的原始问题的最著名的上界是由Grable(1997)提出的$n^{7/4+o(1)}$。没有非平凡的下限是可用的。在这里,我们证明了随机三角形删除中的最终边数很可能等于$n^{3/2+o(1)}$,从而证实了Bollobás和Erdés所提出的3/2指数,并与Spencer等人的预测相匹配。对于上界,对于任何固定的$ε>0$,我们通过按规定的方式顺序粘合$O(1/ε)$三角形来构造一族$\exp(O(1/ε))$图,并动态跟踪它们的所有同态,以任意两个顶点为根,直到保留$n^{3/2+ε}$边的点。一个鞅系统建立了这些随机变量的浓度在其类似的平均值在一个随机图与相应的边缘密度,和一个关键的作用…
Spectral extremal results for triangle-free graphs with chromatic number at least four
School of Mathematics, East China University of Science and Technology(华东理工大学数学学院);School of Mathematics and Physics, Xinjiang Institute of Engineering(新疆工程学院数理学院)
Uppsala University(乌普萨拉大学);Moscow Institute of Physics and Technology(莫斯科物理技术学院);School of Computer Science, The University of Sheffield(谢菲尔德大学计算机科学学院)
On the minimum number of triangles in balanced tripartite graphs with large minimum degree
School of Computer Science and Technology, Dongguan University of Technology(东莞理工学院计算机科学与技术学院);School of Mathematical Sciences, Zhejiang Normal University(浙江师范大学数学科学学院)
Supersaturation in Nosal graphs: Triangles and books
School of Mathematics and Statistics, Gansu Center for Applied Mathematics, Lanzhou University(兰州大学数学与统计学院,甘肃省应用数学中心);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);School of Mathematics and Statistics, Xi’an Jiaotong University(西安交通大学数学与统计学院)
East China University of Science and Technology(华东理工大学);Tianjin University(天津大学);College of Computer Science, Nankai University(南开大学计算机学院);Xinjiang University(新疆大学)
The spectral Erdős book theorem: sharp bounds and stability
Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);School of Mathematical Sciences, Anhui University(安徽大学数学科学学院);College of Cryptology and Cyber Science & College of Computer Science, Nankai University(南开大学密码学与网络空间安全学院及计算机学院)
More on Nosal's spectral theorem: Books and $4$-cycles
Yau Mathematical Sciences Center, Tsinghua University(丘成桐数学科学中心,清华大学);Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS)(极端组合学与概率研究组(ECOPRO),基础科学研究院(IBS));Department of Mathematics, Stanford University(数学系,斯坦福大学)
Spectral supersaturation for color-critical graphs
School of Mathematics, East China University of Science and Technology(华东理工大学数学学院);Yau Mathematical Sciences Center, Tsinghua University(清华大学丘成桐数学科学中心);School of Mathematical Sciences, University of Science and Technology of China(中国科学技术大学数学科学学院)
Edge-spectral Turán theorems for color-critical graphs with applications
Yau Mathematical Sciences Center, Tsinghua University(丘成桐数学科学中心,清华大学);Extremal Combinatorics and Probability Group (ECOPRO), Institute for Basic Science (IBS)(极值组合与概率组(ECOPRO),基础科学研究院(IBS));Department of Mathematics, Stanford University(斯坦福大学数学系)