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

DOI10.1007/S00493-014-3066-7zbMath1363.05118arXiv1201.3861OpenAlexW2009398469MaRDI QIDQ313432

Tamás Hubai, Miklós Abért

Publication date: 9 September 2016

Published in: Combinatorica (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1201.3861

zbMATH Keywords

weak convergencegirthBenjamini-Schramm convergencechromatic measure

Mathematics Subject Classification ID

Graph polynomials (05C31) Coloring of graphs and hypergraphs (05C15) Isomorphism problems in graph theory (reconstruction conjecture, etc.) and homomorphisms (subgraph embedding, etc.) (05C60) Density (toughness, etc.) (05C42)

Related Items (16)

Evaluations of Tutte polynomials of regular graphs ⋮ Matching measure, Benjamini-Schramm convergence and the monomer-dimer free energy ⋮ Benjamini-Schramm continuity of root moments of graph polynomials ⋮ CHROMATIC POLYNOMIALS OF n-CENTIPEDE AND TRIANGULAR SNAKE TSn GRAPHS ⋮ Unnamed Item ⋮ Convergence of graphs with intermediate density ⋮ Random cluster model on regular graphs ⋮ The distribution of sandpile groups of random regular graphs ⋮ Statistical Matching Theory ⋮ Sidorenko's conjecture, colorings and independent sets ⋮ Chromatic roots and limits of dense graphs ⋮ Matchings in Benjamini–Schramm convergent graph sequences ⋮ Zero-free regions of partition functions with applications to algorithms and graph limits ⋮ CHROMATIC POLYNOMIALS OF K_{m}+P_{n}, K_{m}+C_{n} AND G\circ H ⋮ Unimodular measures on the space of all Riemannian manifolds ⋮ Characteristic power series of graph limits

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Benjamini-Schramm continuity of root moments of graph polynomials
• Potts model on infinite graphs and the limit of chromatic polynomials
• Recurrence of distributional limits of finite planar graphs
• Transfer matrices and partition-function zeros for antiferromagnetic Potts models. V. Further results for the square-lattice chromatic polynomial
• Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
• Absence of Zeros for the Chromatic Polynomial on Bounded Degree Graphs
• Counting without sampling: Asymptotics of the log-partition function for certain statistical physics models
• Left and right convergence of graphs with bounded degree
• Asymptotic Enumeration of Spanning Trees
• [https://portal.mardi4nfdi.de/wiki/Publication:5731810 On the foundations of combinatorial theory I. Theory of M�bius Functions]

This page was built for publication: Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphs