pith. sign in

arxiv: 0704.2617 · v1 · submitted 2007-04-19 · 🧮 math-ph · math.CO· math.MP

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

classification 🧮 math-ph math.COmath.MP
keywords chromaticdegreegraphsmathbbzerosborgsboundedcard
0
0 comments X
read the original abstract

We prove that the chromatic polynomial $P_\mathbb{G}(q)$ of a finite graph $\mathbb{G}$ of maximal degree $\D$ is free of zeros for $\card q\ge C^*(\D)$ with $$ 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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.