English

Regions without complex zeros for chromatic polynomials on graphs with bounded degree

Mathematical Physics 2007-05-23 v1 Combinatorics math.MP

Abstract

We prove that the chromatic polynomial PG(q)P_\mathbb{G}(q) of a finite graph G\mathbb{G} of maximal degree \D\D is free of zeros for \cardqC(\D)\card q\ge C^*(\D) with C(\D)=min0<x<21\D1(1+x)\D1x[2(1+x)\D] C^*(\D) = \min_{0<x<2^{1\over \D}-1} {(1+x)^{\D-1}\over x [2-(1+x)^\D]} This improves results by Sokal (2001) and Borgs (2005). Furthermore, we present a strengthening of this condition for graphs with no triangle-free vertices.

Cite

@article{arxiv.0704.2617,
  title  = {Regions without complex zeros for chromatic polynomials on graphs with bounded degree},
  author = {Roberto Fernandez and Aldo Procacci},
  journal= {arXiv preprint arXiv:0704.2617},
  year   = {2007}
}
R2 v1 2026-06-21T08:20:22.791Z