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

Journal of Combinatorial Theory. Series B

Volumn 99, Issue 6, 2009, Pages 869-903

  Jackson, Bill ^a   Sokal, Alan D ^b  

^a QUEEN MARY UNIVERSITY OF LONDON   (United Kingdom)

^b POLYTECHNIC UNIVERSITY   (United States)

Author keywords

Characteristic polynomial; Chromatic polynomial; Chromatic root; Dichromatic polynomial; Flow polynomial; Flow root; Graph; Matroid; Potts model; Tutte polynomial; Zero free interval

Indexed keywords

EID: 72049120149     PISSN: 00958956     EISSN: 10960902     Source Type: Journal    
DOI: 10.1016/j.jctb.2009.03.002     Document Type: Article

References (39)

1. Birkhoff G.D. A determinant formula for the number of ways of coloring a map. Ann. of Math. 14 (1912) 42-46
2. Brown J.I., and Hickman C.A. On chromatic roots of large subdivisions of graphs. Discrete Math. 242 (2002) 17-30
3. Brylawski T., and Oxley J. The Tutte polynomial and its applications. In: White N. (Ed). Matroid Applications. Encyclopedia Math. Appl. vol. 40 (1992), Cambridge Univ. Press, Cambridge 123-225
4. Chartrand G., Kaugars A., and Lick D.R. Critically n-connected graphs. Proc. Amer. Math. Soc. 32 (1972) 63-68
5. Chia G.L. A bibliography on chromatic polynomials. Discrete Math. 172 (1997) 175-191
6. Derrida B., De Seze L., and Itzykson C. Fractal structure of zeros in hierarchical models. J. Stat. Phys. 33 (1983) 559-569
7. F.-M. Dong, private communication, June 2008
8. Edwards H., Hierons R., and Jackson B. The zero-free intervals for characteristic polynomials of matroids. Combin. Probab. Comput. 7 (1998) 153-165
9. Edwards R.G., and Sokal A.D. Generalization of the Fortuin-Kasteleyn-Swendsen-Wang representation and Monte Carlo algorithm. Phys. Rev. D 38 (1988) 2009-2012
10. Egawa Y. Contractible edges in n-connected graphs with minimum degree greater than or equal to [5 n / 4]. Graphs Combin. 7 (1991) 15-21
11. Fortuin C.M., and Kasteleyn P.W. On the random-cluster model. I. Introduction and relation to other models. Physica 57 (1972) 536-564
12. Gebhard D.D., and Sagan B.E. Sinks in acyclic orientations of graphs. J. Combin. Theory Ser. B 80 (2000) 130-146
13. Greene C., and Zaslavsky T. On the interpretation of Whitney numbers through arrangements of hyperplanes, zonotopes, non-Radon partitions, and orientations of graphs. Trans. Amer. Math. Soc. 280 (1983) 97-126
14. Itzykson C., and Luck J.M. Zeroes of the partition function for statistical models on regular and hierarchical lattices. In: Ceauşescu V., Costache G., and Georgescu V. (Eds). Critical Phenomena, 1983 Brasov School Conference (1985), Birkhäuser, Boston 45-82
15. Jackson B. A zero-free interval for chromatic polynomials of graphs. Combin. Probab. Comput. 2 (1993) 325-336
16. Jackson B. Zeros of chromatic and flow polynomials of graphs. J. Geom. 76 (2003) 95-109. arXiv:math.CO/0205047
17. Kasteleyn P.W., and Fortuin C.M. Phase transitions in lattice systems with random local properties. J. Phys. Soc. Japan 26 Suppl. (1969) 11-14
18. Kriesell M. A degree sum condition for the existence of a contractible edge in a κ-connected graph. J. Combin. Theory Ser. B 82 (2001) 81-101
19. Oxley J.G. On minor-minimally-connected matroids. Discrete Math. 51 (1984) 63-72
20. Oxley J.G. Matroid Theory (1992), Oxford Univ. Press, New York
21. Oxley J.G. On the interplay between graphs and matroids. In: Hirschfeld J.W.P. (Ed). Surveys in Combinatorics 2001 (2001), Cambridge Univ. Press, Cambridge 199-239
22. Potts R.B. Some generalized order-disorder transformations. Proc. Cambridge Philos. Soc. 48 (1952) 106-109
23. Read R.C. An introduction to chromatic polynomials. J. Combin. Theory 4 (1968) 52-71
24. Read R.C., and Tutte W.T. Chromatic polynomials. In: Beineke L.W., and Wilson R.J. (Eds). Selected Topics in Graph Theory 3 (1988), Academic Press, London 15-42
25. Royle G., and Sokal A.D. The Brown-Colbourn conjecture on zeros of reliability polynomials is false. J. Combin. Theory Ser. B 91 (2004) 345-360. arXiv:math.CO/0301199
26. Salas J., and Sokal A.D. Transfer matrices and partition-function zeros for antiferromagnetic Potts models. I. General theory and square-lattice chromatic polynomial. J. Stat. Phys. 104 (2001) 609-699. arXiv:cond-mat/0004330
27. Scott A.D., and Sokal A.D. The repulsive lattice gas, the independent-set polynomial, and the Lovász local lemma. J. Stat. Phys. 118 (2005) 1151-1261. arXiv:cond-mat/0309352
28. Shrock R. Chromatic polynomials and their zeros and asymptotic limits for families of graphs. Discrete Math. 231 (2001) 421-446. arXiv:cond-mat/9908387
29. Sokal A.D. Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions. Combin. Probab. Comput. 10 (2001) 41-77. arXiv:cond-mat/9904146
30. Sokal A.D. Chromatic roots are dense in the whole complex plane. Combin. Probab. Comput. 13 (2004) 221-261. arXiv:cond-mat/0012369
31. Sokal A.D. The multivariate Tutte polynomial (alias Potts model) for graphs and matroids. In: Webb B.S. (Ed). Surveys in Combinatorics 2005 (2005), Cambridge Univ. Press, Cambridge 173-226. arXiv:math.CO/0503607
32. Thomassen C. The zero-free intervals for chromatic polynomials of graphs. Combin. Probab. Comput. 6 (1997) 497-506
33. Tutte W.T. A ring in graph theory. Proc. Cambridge Philos. Soc. 43 (1947) 26-40
34. Tutte W.T. A contribution to the theory of chromatic polynomials. Canad. J. Math. 6 (1954) 80-91
35. Wagner D.G. Zeros of reliability polynomials and f-vectors of matroids. Combin. Probab. Comput. 9 (2000) 167-190
36. Whitney H. A logical expansion in mathematics. Bull. Amer. Math. Soc. 38 (1932) 572-579
37. Wu F.Y. The Potts model. Rev. Modern Phys. 54 (1982) 235-268 Erratum:
38. Wu F.Y. The Potts model. Rev. Modern Phys. 55 (1983) 315
39. Wu F.Y. Potts model of magnetism (invited). J. Appl. Phys. 55 (1984) 2421-2425