Benjamini–Schramm continuity of root moments of graph polynomials
Authors:
- Péter CsikváriPCPéter Csikvári
- Péter E. FrenkelPFPéter E. Frenkel
- 1 February 2016
- journal article
- Published by Elsevier in European Journal of Combinatorics
- Vol. 52, 302-320
Abstract
No abstract availableAll Related Versions
Funding Information
- MTA Rényi “Lendület” Groups
- Graphs Research Group
- National Science Foundation (DMS-1500219)
This publication has 13 references indexed in Scilit:
- Benjamini-Schramm convergence and the distribution of chromatic roots for sparse graphsCombinatorica, 2014
- Complex zero-free regions at large for multivariate Tutte polynomials (alias Potts-model partition functions) with general complex edge weightsJournal of Combinatorial Theory, Series B, 2013
- Two remarks on the adjoint polynomialEuropean Journal of Combinatorics, 2012
- Left and right convergence of graphs with bounded degreeRandom Structures & Algorithms, 2012
- Absence of Zeros for the Chromatic Polynomial on Bounded Degree GraphsCombinatorics, Probability and Computing, 2006
- Asymptotic Enumeration of Spanning TreesCombinatorics, Probability and Computing, 2005
- On the theory of the matching polynomialJournal of Graph Theory, 1981
- Theory of monomer-dimer systemsCommunications in Mathematical Physics, 1972
- An introduction to chromatic polynomialsJournal of Combinatorial Theory, 1968
- Mergelyan's Theorem on Uniform Polynomial Approximation.MATHEMATICA SCANDINAVICA, 1964