Enumerative combinatorics
A zero-free interval for chromatic polynomials
Discrete Mathematics - Special volume (part two) to mark the centennial of Julius Petersen's “Die theorie der regula¨ren graphs” (“The theory of regular graphs”)
Roots of the reliability polynomial
SIAM Journal on Discrete Mathematics
Chromatic polynomials, polygon trees, and outerplanar graphs
Journal of Graph Theory
Complexity: knots, colourings and counting
Complexity: knots, colourings and counting
The largest real zero of the chromatic polynomial
CPRT '94 Proceedings of the conference on Chromatic polynomials and related topics
A bibliography on chromatic polynomials
CPRT '94 Proceedings of the conference on Chromatic polynomials and related topics
Journal of Combinatorial Theory Series B - Special issue: dedicated to Professor W. T. Tutte on the occasion of his eightieth birthday
On the roots of chromatic polynomials
Journal of Combinatorial Theory Series B
Chromatic polynomials and order ideals of monomials
Discrete Mathematics
Discrete Mathematics - selected papers in honor of Adriano Garsia
The Combinatorics of Network Reliability
The Combinatorics of Network Reliability
Zeros of Reliability Polynomials and f-vectors of Matroids
Combinatorics, Probability and Computing
The Zero-Free Intervals for Characteristic Polynomials of Matroids
Combinatorics, Probability and Computing
The Zero-Free Intervals for Chromatic Polynomials of Graphs
Combinatorics, Probability and Computing
Combinatorial Enumeration
Tutte polynomial expansions for 2-separable graphs
Discrete Mathematics
Algebraic methods for chromatic polynomials
European Journal of Combinatorics - Special issue on algebraic combinatorics: in memory of J.J. Seidel
Chromatic Roots are Dense in the Whole Complex Plane
Combinatorics, Probability and Computing
The Brown--Colbourn conjecture on zeros of reliability polynomials is false
Journal of Combinatorial Theory Series B
Two Results on Real Zeros of Chromatic Polynomials
Combinatorics, Probability and Computing
Polynomials with the half-plane property and the support theorems
Journal of Combinatorial Theory Series B
On Dependency Graphs and the Lattice Gas
Combinatorics, Probability and Computing
Regions without complex zeros for chromatic polynomials on graphs with bounded degree
Combinatorics, Probability and Computing
Bounds for the real zeros of chromatic polynomials
Combinatorics, Probability and Computing
Journal of Combinatorial Theory Series B
New graph polynomials from the bethe approximation of the ising partition function
Combinatorics, Probability and Computing
On the roots of edge cover polynomials of graphs
European Journal of Combinatorics
Two remarks on the adjoint polynomial
European Journal of Combinatorics
Improved bounds on coloring of graphs
European Journal of Combinatorics
On Brenti's conjecture about the log-concavity of the chromatic polynomial
European Journal of Combinatorics
Journal of Combinatorial Theory Series B
Hi-index | 0.00 |
We show that there exist universal constants C(r) G of maximum degree ≤ r, the zeros (real or complex) of the chromatic polynomial PG(q) lie in the disc ∣q∣ C(r). Furthermore, C(r) ≤ 7.963907r. This result is a corollary of a more general result on the zeros of the Potts-model partition function ZG(q, {ve}) in the complex antiferromagnetic regime ∣1 + ve∣ ≤ 1. The proof is based on a transformation of the Whitney–Tutte–Fortuin–Kasteleyn representation of ZG(q, {ve}) to a polymer gas, followed by verification of the Dobrushin–Kotecký–Preiss condition for nonvanishing of a polymer-model partition function. We also show that, for all loopless graphs G of second-largest degree ≤ r, the zeros of PG(q) lie in the disc ∣q∣ C(r) + 1. Along the way, I give a simple proof of a generalized (multivariate) Brown–Colbourn conjecture on the zeros of the reliability polynomial for the special case of series-parallel graphs.