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

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

[1]  Christian Borgs,et al.  Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs , 2006, Combinatorics, Probability and Computing.

[2]  R. Fernández,et al.  On the Convergence of Cluster Expansions for Polymer Gases , 2010, 1002.3261.

[3]  Alexander I. Barvinok,et al.  Combinatorics and Complexity of Partition Functions , 2017, Algorithms and combinatorics.

[4]  Alexander I. Barvinok,et al.  Weighted counting of solutions to sparse systems of equations , 2017, Combinatorics, Probability and Computing.

[5]  Bill Jackson,et al.  Complex zero-free regions at large |q| for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weights , 2008, J. Comb. Theory, Ser. B.

[6]  Sakinah,et al.  Vol. , 2020, New Medit.

[7]  G. Birkhoff A Determinant Formula for the Number of Ways of Coloring a Map , 1912 .

[8]  Svante Janson,et al.  Random Even Graphs , 2007, Electron. J. Comb..

[9]  B. L. Waerden Die lange Reichweite der regelmäßigen Atomanordnung in Mischkristallen , 1941 .

[10]  P. Steerenberg,et al.  Targeting pathophysiological rhythms: prednisone chronotherapy shows sustained efficacy in rheumatoid arthritis. , 2010, Annals of the rheumatic diseases.

[11]  Alan D. Sokal,et al.  Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions , 1999, Combinatorics, Probability and Computing.

[12]  G. Royle,et al.  Location of Zeros of Chromatic and Related Polynomials of Graphs , 1994, Canadian Journal of Mathematics.

[13]  Ryan L. Mann,et al.  Approximation Algorithms for Complex-Valued Ising Models on Bounded Degree Graphs , 2018, ArXiv.

[14]  Piyush Srivastava,et al.  Fisher zeros and correlation decay in the Ising model , 2018, ITCS.

[15]  Viresh Patel,et al.  Deterministic polynomial-time approximation algorithms for partition functions and graph polynomials , 2016, Electron. Notes Discret. Math..

[16]  Bill Jackson,et al.  Maxmaxflow and Counting Subgraphs , 2010, Electron. J. Comb..

[17]  Aldo Procacci,et al.  Regions Without Complex Zeros for Chromatic Polynomials on Graphs with Bounded Degree , 2008, Comb. Probab. Comput..

[18]  A. Karimi,et al.  Master‟s thesis , 2011 .

[19]  Bill Jackson,et al.  Zeros of chromatic and flow polynomials of graphs , 2002, math/0205047.