Connectivity for Bridge-Addable Monotone Graph Classes

DOI10.1017/S0963548312000272zbMath1253.05089arXiv1110.0009MaRDI QIDQ3168442

Louigi Addario-Berry, Colin J. H. McDiarmid, Bruce A. Reed

Publication date: 31 October 2012

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1110.0009

zbMATH Keywords

probabilistic results; addable graph classes

Mathematics Subject Classification ID

05C80: Random graphs (graph-theoretic aspects)

60C05: Combinatorial probability

05C10: Planar graphs; geometric and topological aspects of graph theory

05C75: Structural characterization of families of graphs

05C40: Connectivity

Related Items

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

Cites Work

• Unnamed Item
• Growth constants of minor-closed classes of graphs
• Random planar graphs
• Asymptotic enumeration and limit laws for graphs of fixed genus
• Enumeration and limit laws for series-parallel graphs
• Connectivity of addable graph classes
• 3-Connected Cores In Random Planar Graphs
• Graph classes with given 3-connected components: asymptotic counting and critical phenomena