ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE

DOI10.1142/9789813272880_0180zbMath1448.05109OpenAlexW2972686631MaRDI QIDQ5122155

Nicholas C. Wormald

Publication date: 22 September 2020

Published in: Proceedings of the International Congress of Mathematicians (ICM 2018) (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/9789813272880_0180

zbMATH Keywords

asymptotic resultsindependent binomial random variables

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Enumeration in graph theory (05C30) Combinatorial probability (60C05) Asymptotic enumeration (05A16)

Related Items (5)

On the sizes of large subgraphs of the binomial random graph ⋮ Friendly bisections of random graphs ⋮ Subgraph distributions in dense random regular graphs ⋮ Lower bounds for contingency tables via Lorentzian polynomials ⋮ Phase transition in random contingency tables with non-uniform margins

This page was built for publication: ASYMPTOTIC ENUMERATION OF GRAPHS WITH GIVEN DEGREE SEQUENCE