arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2505.04366math.COcs.DMcs.DS
收藏

对图的色多项式零点的改进界

Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs

Centrum Wiskunde & Informatica(数学与计算机科学中心);Korteweg de Vries Institute for Mathematics, University of Amsterdam(阿姆斯特丹大学科特韦格-德弗里斯数学研究所)

Ferenc Bencs, Guus Regts

AI总结:

研究改进了图色多项式零点的界,针对无爪图和高环长图给出了更优的界,并引入了新的方法来分析色多项式系数。

摘要:

我们证明,对于任意图G,其色多项式χ_G(x)的复零点位于以0为中心、半径为4.25Δ(G)的圆内,其中Δ(G)表示图G的最大度数。这改进了Jenssen、Patel和Regts最近的结果,他们证明了一个界为5.94Δ(G)。此外,我们显示对于足够大的环长的图,可以将4.25替换为3.60,而对于无爪图,可以将4.25替换为3.81。我们的证明在Jenssen、Patel和Regts开发的思路基础上,加入了一些实质性的新思想。对于无爪图,关键的新成分是利用色多项式系数的某种表示形式,以表示某些部分无环定向的数量。

英文摘要:

We prove that for any graph $G$ the (complex) zeros of its chromatic polynomial, $χ_G(x)$, lie inside the disk centered at $0$ of radius $4.25 Δ(G)$, where $Δ(G)$ denotes the maximum degree of $G$. This improves on a recent result of Jenssen, Patel and Regts, who proved a bound of $5.94Δ(G)$. Moreover, we show that for graphs of sufficiently large girth we can replace $4.25$ by $3.60$ and for claw-free graphs we can replace $4.25$ by $3.81$. Our proofs add some substantially novel ideas to those developed by Jenssen, Patel, and Regts, while building on them. A key novel ingredient for claw-free graphs is to use a representation of the coefficients of the chromatic polynomial in terms of the number of certain partial acyclic orientations.

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

↑