arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2204.09194math.COmath.SP
收藏

关于谱Turán定理的精化

Refinement on spectral Turán's theorem

Yongtao Li, Yuejian Peng

AI总结:

本文为谱Turán定理及其在非二部无三角形图上的精化提供了替代证明,并将该精化推广至非$r$部无$K_{r+1}$图,精化了Nikiforov定理且可视为Brouwer定理的谱版本。

摘要:

极值谱图论中一个著名结果由Nosal和Nikiforov给出,指出若$G$是$n$个顶点的无三角形图,则$λ(G) \le λ(K_{\lfloor \frac{n}{2}\rfloor, \lceil \frac{n}{2} \rceil })$,等号成立当且仅当$G=K_{\lfloor \frac{n}{2}\rfloor, \lceil \frac{n}{2} \rceil }$。Nikiforov [Linear Algebra Appl. 427 (2007)] 将该结果推广至每个整数$r\ge 2$的无$K_{r+1}$图,即谱Turán定理。近期,Lin, Ning和Wu [Combin. Probab. Comput. 30 (2021)] 针对非二部无三角形图证明了该结果的精化。本文为Nikiforov及Lin, Ning和Wu的结果提供了替代证明。我们的证明可将后一结果推广至非$r$部无$K_{r+1}$图。我们的结果精化了Nikiforov定理,也可视为Brouwer定理的谱版本。

英文摘要:

A well-known result in extremal spectral graph theory, due to Nosal and Nikiforov, states that if $G$ is a triangle-free graph on $n$ vertices, then $λ(G) \le λ(K_{\lfloor \frac{n}{2}\rfloor, \lceil \frac{n}{2} \rceil })$, equality holds if and only if $G=K_{\lfloor \frac{n}{2}\rfloor, \lceil \frac{n}{2} \rceil }$. Nikiforov [Linear Algebra Appl. 427 (2007)] extended this result to $K_{r+1}$-free graphs for every integer $r\ge 2$. This is known as the spectral Turán theorem. Recently, Lin, Ning and Wu [Combin. Probab. Comput. 30 (2021)] proved a refinement on this result for non-bipartite triangle-free graphs. In this paper, we provide alternative proofs for the result of Nikiforov and the result of Lin, Ning and Wu. Our proof can allow us to extend the later result to non-$r$-partite $K_{r+1}$-free graphs. Our result refines the theorem of Nikiforov and it also can be viewed as a spectral version of a theorem of Brouwer.

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

↑