Connectedness of graphs generated by a random d-process

DOI10.1017/S1446788700003591zbMath0997.05092MaRDI QIDQ4534463

Andrzej Ruciński, Nicholas C. Wormald

Publication date: 17 November 2002

Published in: Journal of the Australian Mathematical Society (Search for Journal in Brave)

zbMATH Keywords

graph process

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Special processes (60K99)

Related Items (3)

The evolution of the min-min random graph process ⋮ On the normality of giant components ⋮ Evolution of random graph processes with degree constraints

Cites Work

• Sharp concentration of the chromatic number on random graphs \(G_{n,p}\)
• Differential equations for random processes and random graphs

This page was built for publication: Connectedness of graphs generated by a random d-process