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 of a finite graph of maximal degree is free of zeros for with 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}
}