Zero-free regions for multivariate Tutte polynomials (alias Potts-model partition functions) of graphs and matroids

Authors:
Bill Jackson;Alan D. Sokal
Affiliations:
School of Mathematical Sciences, Queen Mary University of London, Mile End Road, London E1 4NS, UK;Department of Physics, New York University, 4 Washington Place, New York, NY 10003, USA
Venue:
Journal of Combinatorial Theory Series B
Year:
2009

Citing 11
Cited 4

A bibliography on chromatic polynomials

CPRT '94 Proceedings of the conference on Chromatic polynomials and related topics
Sinks in acyclic orientations of graphs

Journal of Combinatorial Theory Series B
Chromatic polynomials and their zeros and asymptotic limits for families of graphs

Discrete Mathematics - Special issue on the 17th british combinatorial conference selected papers
A degree sum condition for the existence of a contractible in a k-connected graph

Journal of Combinatorial Theory Series B
On chromatic roots of large subdivisions of graphs

Discrete Mathematics
Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions

Combinatorics, Probability and Computing
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
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

Mehler formulae for matching polynomials of graphs and independence polynomials of clawfree graphs

Journal of Combinatorial Theory Series B
The complexity of computing the sign of the tutte polynomial (and consequent #p-hardness of approximation)

ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part I
Approximating the partition function of the ferromagnetic Potts model

Journal of the ACM (JACM)
Is the five-flow conjecture almost false?

Journal of Combinatorial Theory Series B

Quantified Score

Hi-index	0.00

Visualization

Abstract

The chromatic polynomial P"G(q) of a loopless graph G is known to be non-zero (with explicitly known sign) on the intervals (-~,0), (0,1) and (1,32/27]. Analogous theorems hold for the flow polynomial of bridgeless graphs and for the characteristic polynomial of loopless matroids. Here we exhibit all these results as special cases of more general theorems on real zero-free regions of the multivariate Tutte polynomial Z"G(q,v). The proofs are quite simple, and employ deletion-contraction together with parallel and series reduction. In particular, they shed light on the origin of the curious number 32/27.