Random graph processes with maximum degree 2

DOI10.1214/AOAP/1034625259zbMath0981.05090OpenAlexW2011121646MaRDI QIDQ1355743

Andrzej Ruciński, Nicholas C. Wormald

Publication date: 14 March 2002

Published in: The Annals of Applied Probability (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1214/aoap/1034625259

zbMATH Keywords

Poisson distributionlimiting distributionrandom graphnumbers of cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Combinatorial probability (60C05) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (3)

The Early Evolution of the Random Graph Process in Planar Graphs and Related Classes ⋮ The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘) ⋮ A sharp threshold for bootstrap percolation in a random hypergraph

This page was built for publication: Random graph processes with maximum degree 2