arXiv Analytics

Sign in

arXiv:2105.03304 [math.CO]AbstractReferencesReviewsResources

Improved bounds for zeros of the chromatic polynomial on bounded degree graphs

Maurizio Moreschi, Viresh Patel, Guus Regts, Ayla Stam

Published 2021-05-07Version 1

We prove that for any graph $G$ of maximum degree at most $\Delta$, the zeros of its chromatic polynomial $\chi_G(z)$ (in $\mathbb{C}$) lie outside the disk of radius $5.02 \Delta$ centered at $0$. This improves on the previously best known bound of approximately $6.91\Delta$. In the case of graphs of high girth we can improve this. We prove that for every $g$ there is a constant $K_g$ such that for any graph $G$ of maximum degree at most $\Delta$ and girth at least $g$, the zeros of its chromatic polynomial $\chi_G(z)$ lie outside the disk of radius $K_g \Delta$ centered at $0$ where $K_g \to 1 + e \approx 3.72$ as $g \to \infty$. Finally, we give improved bounds on the Fisher zeros of the partition function of the Ising model.

Related articles: Most relevant | Search more
arXiv:1810.01699 [math.CO] (Published 2018-10-03)
Location of zeros for the partition function of the Ising model on bounded degree graphs
arXiv:1607.01167 [math.CO] (Published 2016-07-05)
Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials
arXiv:2505.06215 [math.CO] (Published 2025-05-09)
A note on the ineffectiveness of the regularity lemma for bounded degree graphs