k-connectivity in random undirected graphs

DOI10.1016/0012-365X(85)90079-2zbMath0567.05036OpenAlexW2053661482MaRDI QIDQ1059644

John H. Reif, Paul G. Spirakis

Publication date: 1985

Published in: Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0012-365x(85)90079-2

zbMATH Keywords

random graphgiant k-blockprobability of connectivityrandom k-blocks

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Strong limit theorems (60F15) Connectivity (05C40)

Related Items (1)

Finding maximum subgraphs with relatively large vertex connectivity

Cites Work

• k-Blocks and Ultrablocks in Graphs
• A structural characterization of planar combinatorial graphs
• On the strength of connectedness of a random graph
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: k-connectivity in random undirected graphs