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

From MaRDI portal
Publication:313432

DOI10.1007/S00493-014-3066-7zbMATH Open1363.05118arXiv1201.3861OpenAlexW2009398469MaRDI QIDQ313432FDOQ313432


Authors: Miklós Abért, Tamás Hubai Edit this on Wikidata


Publication date: 9 September 2016

Published in: Combinatorica (Search for Journal in Brave)

Abstract: 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'asz, 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.


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




Recommendations




Cites Work


Cited In (17)





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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q313432)