, Volume 35, Issue 2, pp 127–151 | Cite as

Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs

  • Miklós AbértEmail author
  • Tamás Hubai
Original Paper


We define the chromatic measure of a finite simple graph as the uniform distribution on its chromatic roots. We show that for a Benjamini-Schramm convergent sequence of finite graphs, the chromatic measures converge in holomorphic moments.

As a corollary, for a convergent sequence of finite graphs, we prove that the normalized log of the chromatic polynomial converges to an analytic function outside a bounded disc. This generalizes a recent result of Borgs, Chayes, Kahn and Lovász, who proved convergence at large enough positive integers and answers a question of Borgs.

Our methods also lead to explicit estimates on the number of proper colorings of graphs with large girth.

Mathematics Subject Classification (2000)

05C31 05C60 05C15 82B20 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. [1]
    A. Bandyopadhyay and D. Gamarnik: Counting without sampling. Asymptotics of the logpartition function for certain statistical physics models, Random Structures & Algorithms 33 (2008), 452–479.CrossRefzbMATHMathSciNetGoogle Scholar
  2. [2]
    C. Borgs: Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs, Combinatorics, Probability and Computing 15 (2006), 63–74.CrossRefzbMATHMathSciNetGoogle Scholar
  3. [3]
    I. Benjamini and O. Schramm: Recurrence of distributional limits of finite planar graphs, Electron. J. Probab. 6 (2001), 1–13.CrossRefMathSciNetGoogle Scholar
  4. [4]
    C. Borgs, J. Chayes, J. Kahn and L. Lovász: Left and right convergence of graphs with bounded degree, Random Structures & Algorithms 42 (2013).Google Scholar
  5. [5]
    P. Csikvári and P. E. Frenkel: Benjamini-Schramm continuity of root moments of graph polynomials,
  6. [6]
    L. Lovász: Large Networks and Graph Limits. Colloquium Publications, vol. 60. American Mathematical Society (2012)Google Scholar
  7. [7]
    R. Lyons: Asymptotic enumeration of spanning trees, Combinatorics, Probability and Computing 14 (2005), 491–522.CrossRefzbMATHMathSciNetGoogle Scholar
  8. [8]
    S. N. Mergelyan: Uniform approximations to functions of a complex variable, Uspehi Mat. Nauk (N.S.) 7 (1952), 31–122.MathSciNetGoogle Scholar
  9. [9]
    A. Procacci, B. Scoppola and V. Gerasimov: Potts model on infinite graphs and the limit of chromatic polynomials, Commun. Math. Phys. 235 (2003), 215–231.CrossRefzbMATHMathSciNetGoogle Scholar
  10. [10]
    G. C. Rota: On the foundations of combinatorial theory I. Theory of Möbius functions, Probability theory and related flelds 2 (1964), 340–368.zbMATHMathSciNetGoogle Scholar
  11. [11]
    J. Salas and A. D. Sokal: Transfer Matrices and Partition-Function Zeros for Antiferromagnetic Potts Models V. Further Results for the Square-Lattice Chromatic Polynomial, J. Stat. Phys. 135 (2009), 279–373.CrossRefzbMATHMathSciNetGoogle Scholar
  12. [12]
    A. D. Sokal: Bounds on the complex zeros of (di)chromatic polynomials and Potts-model partition functions, Combinatorics, Probability and Computing 10 (2001), 41–77.zbMATHMathSciNetGoogle Scholar
  13. [13]
    A. D. Sokal: The multivariate Tutte polynomial (alias Potts model) for graphs and matroids, in: Surveys in Combinatorics (Webb, BS, ed.), 2005, 173–226. Cambridge University Press.Google Scholar

Copyright information

© János Bolyai Mathematical Society and Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  1. 1.Alfréd Rényi Institute of MathematicsHungarian Academy of SciencesBudapestHungary
  2. 2.Department of Computer ScienceEötvös Loránd UniversityBudapestHungary

Personalised recommendations