I show that the zeros of the chromatic polynomials PG(q) for the generalized theta graphs $\Theta(s,p)$ are, taken together, dense in the whole complex plane with the possible exception of the disc $|q − 1| < 1$. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) $Z_G(q, v)$ outside the disc $|q + v| < |v|$.
An immediate corollary is that the chromatic roots of not-necessarily-planar graphs are dense in the whole complex plane. The main technical tool in the proof of these results is the Beraha–Kahane–Weiss theorem on the limit sets of zeros for certain sequences of analytic functions, for which I give a new and simpler proof.
%0 Journal Article
%1 sokal04
%A Sokal, Alan D.
%D 2004
%J Combinatorics, Probability and Computing
%K chromatic graph.theory polynomial potts root root-free
%N 02
%P 221--261
%R 10.1017/S0963548303006023
%T Chromatic Roots are Dense in the Whole Complex Plane
%V 13
%X I show that the zeros of the chromatic polynomials PG(q) for the generalized theta graphs $\Theta(s,p)$ are, taken together, dense in the whole complex plane with the possible exception of the disc $|q − 1| < 1$. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) $Z_G(q, v)$ outside the disc $|q + v| < |v|$.
An immediate corollary is that the chromatic roots of not-necessarily-planar graphs are dense in the whole complex plane. The main technical tool in the proof of these results is the Beraha–Kahane–Weiss theorem on the limit sets of zeros for certain sequences of analytic functions, for which I give a new and simpler proof.
@article{sokal04,
abstract = {I show that the zeros of the chromatic polynomials PG(q) for the generalized theta graphs $\Theta(s,p)$ are, taken together, dense in the whole complex plane with the possible exception of the disc $|q − 1| < 1$. The same holds for their dichromatic polynomials (alias Tutte polynomials, alias Potts-model partition functions) $Z_G(q, v)$ outside the disc $|q + v| < |v|$.
An immediate corollary is that the chromatic roots of not-necessarily-planar graphs are dense in the whole complex plane. The main technical tool in the proof of these results is the Beraha–Kahane–Weiss theorem on the limit sets of zeros for certain sequences of analytic functions, for which I give a new and simpler proof.},
added-at = {2015-07-04T12:08:41.000+0200},
author = {Sokal, Alan D.},
biburl = {https://www.bibsonomy.org/bibtex/2989ab36d375b679b8aeb38e0fe7b2c59/ytyoun},
doi = {10.1017/S0963548303006023},
interhash = {355ceff4bf78254c10e1b8d2663645c7},
intrahash = {989ab36d375b679b8aeb38e0fe7b2c59},
issn = {1469-2163},
journal = {Combinatorics, Probability and Computing},
keywords = {chromatic graph.theory polynomial potts root root-free},
month = {3},
number = 02,
numpages = {41},
pages = {221--261},
timestamp = {2016-02-28T10:53:00.000+0100},
title = {Chromatic Roots are Dense in the Whole Complex Plane},
volume = 13,
year = 2004
}