AI 中文总结
该研究证明了Tang与Elphick提出的关于简单非空图色数、边数与最小特征值的不等式猜想,明确等号成立的图类条件,完善了图论中色数与谱参数关系的理论。
AI 中文摘要
设G为简单非空图,边数为m,色数为χ,最小特征值为λ。我们证明不等式χ(χ−1)≤(m+1−λ²)+√[(m+1−λ²)²−4(λ²−1)(λ²−m)],等号当且仅当G为完全图或完全二部图(可含孤立顶点)时成立。该不等式由Tang与Elphick近期在《Electron. J. Combin.》33卷(2026年)第#P2.65篇中提出猜想。
英文摘要
Let $G$ be a simple nonempty graph with size $m$, chromatic number $χ$, and least eigenvalue $λ$. We prove that \[ χ(χ-1) \le (m+1-λ^2)+\sqrt{(m+1-λ^2)^2-4(λ^2-1)(λ^2-m)} \] with equality if and only if $G$ is either a complete graph or a complete bipartite graph, with possibly isolated vertices. The inequality was conjectured recently by Tang and Elphick in [Electron. J. Combin. 33 (2026), \#P2.65].