🔮
🔮
The Ethereal
Improved bounds on the zeros of the chromatic polynomial of graphs and claw-free graphs
May 07, 2025 · The Ethereal · 🏛 arXiv.org
"No code URL or promise found in abstract"
Evidence collected by the PWNC Scanner
Authors
Ferenc Bencs, Guus Regts
arXiv ID
2505.04366
Category
math.CO: Combinatorics
Cross-listed
cs.DM,
cs.DS
Citations
3
Venue
arXiv.org
Last Checked
6 months ago
Abstract
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.
Community Contributions
Found the code? Know the venue? Think something is wrong? Let us know!
📜 Similar Papers
In the same crypt — Combinatorics
🔮
🔮
The Ethereal
On cap sets and the group-theoretic approach to matrix multiplication
🔮
🔮
The Ethereal
Generalized Twisted Gabidulin Codes
🔮
🔮
The Ethereal
Tables of subspace codes
🔮
🔮
The Ethereal
Classification of weighted networks through mesoscale homological features
🔮
🔮
The Ethereal