On the connectivity of random graphs from addable classes

DOI10.1016/j.jctb.2012.12.001zbMath1261.05094OpenAlexW2000910910MaRDI QIDQ1946000

Mihyun Kang, Konstantinos D. Panagiotou

Publication date: 17 April 2013

Published in: Journal of Combinatorial Theory. Series B (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jctb.2012.12.001

zbMATH Keywords

bridge-addable classweakly addable class

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Structural characterization of families of graphs (05C75) Connectivity (05C40)

Related Items (9)

Connectivity for bridge-alterable graph classes ⋮ Asymptotic Properties of Some Minor-Closed Classes of Graphs ⋮ Longest and shortest cycles in random planar graphs ⋮ Connectivity in bridge-addable graph classes: the McDiarmid-Steger-Welsh conjecture ⋮ Local Convergence and Stability of Tight Bridge-addable Classes ⋮ Bridge-Addability, Edge-Expansion and Connectivity ⋮ The Evolution of Random Graphs on Surfaces ⋮ Logical limit laws for minor-closed classes of graphs ⋮ Random graphs from a block-stable class

This page was built for publication: On the connectivity of random graphs from addable classes