arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2407.19341math.CO
收藏

Bollobás-Nikiforov猜想:关于三角形数量不多的图

Bollobás-Nikiforov Conjecture for graphs with not so many triangles

Hitesh Kumar, Shivaramakrishna Pragada

AI总结:

本文验证了Bollobás-Nikiforov猜想的推广形式,证明了对于边数为$m$且三角形数量至多为$O(m^{1.5-\varepsilon})$的图族该猜想成立,特别指出其在平面图、无书图和无环图中成立。

摘要:

Bollobás和Nikiforov猜想,对于任意具有$m$条边且$G \neq K_n$的图,\\[ λ_1^2+λ_2^2\le \bigg( 1-\frac{1}{ω(G)}\bigg)2m\\]其中$λ_1$和$λ_2$表示邻接矩阵$A(G)$的两个最大特征值,$ω$表示$G$的团数。该猜想最近由Lin, Ning和Wu针对无三角形图验证,并由Zhang针对正则图验证。Elphick, Wocjan和Linz提出了该猜想的一个推广。在本文中,我们针对包含至多$O(m^{1.5-\varepsilon})$个三角形的$m$条边图族(其中$\varepsilon > 0$)验证了这一推广猜想。特别地,我们证明了该猜想在平面图、无书图和无环图中成立。

英文摘要:

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.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑