English

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

Combinatorics 2021-12-22 v2

Abstract

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

Keywords

Cite

@article{arxiv.2105.03304,
  title  = {Improved bounds for zeros of the chromatic polynomial on bounded degree graphs},
  author = {Maurizio Moreschi and Viresh Patel and Guus Regts and Ayla Stam},
  journal= {arXiv preprint arXiv:2105.03304},
  year   = {2021}
}

Comments

Eq (2.4) is not correct and as such this invalidates Theorem 2.3 and consequently all the claimed results on the modulus of the zeros of chromatic polynomial. As fas as we can tell the results for the edge based block polynomials are correct (this concerns Sections 4 and 5). We will probably resubmit this part as part of a new paper at some point in the future