Distribution of coefficients of rank polynomials for random sparse graphs
From MaRDI portal
Publication:668020
zbMath1406.05047MaRDI QIDQ668020
Dmitry Jakobson, Callum MacRury, Serguei Norine, Lise Turner
Publication date: 5 March 2019
Published in: The Electronic Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://www.combinatorics.org/ojs/index.php/eljc/article/view/v25i4p50
Graph polynomials (05C31) Random graphs (graph-theoretic aspects) (05C80) Convergence of probability measures (60B10) Infinite graphs (05C63) Density (toughness, etc.) (05C42)
Related Items (1)
Cites Work
- Benjamini-Schramm continuity of root moments of graph polynomials
- Spanning trees in regular graphs
- Bounds on the Complex Zeros of (Di)Chromatic Polynomials and Potts-Model Partition Functions
- Extremal metrics on graphs I
- How to pick a random integer matrix? (and other questions)
- Rank and Bollobás-Riordan polynomials: Coefficient measures and zeros
- A Generalization of Line Connectivity and Optimally Invulnerable Graphs
- Asymptotic Enumeration of Spanning Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: Distribution of coefficients of rank polynomials for random sparse graphs