The connectivity threshold for the min‐degree random graph process

DOI10.1002/rsa.20125zbMath1101.05063OpenAlexW4231205967MaRDI QIDQ5486310

Sangwook Ree, Tomasz Łuczak, Mihyun Kang, Youngmee Koh

Publication date: 6 September 2006

Published in: Random Structures & Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/rsa.20125

zbMATH Keywords

probabilityminimum degreerandom multigraph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Markov chains (discrete-time Markov processes on discrete state spaces) (60J10)

Related Items (4)

GHS algorithm on a graph with random weights ⋮ 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

• Cycles in a Uniform Graph Process

This page was built for publication: The connectivity threshold for the min‐degree random graph process