Random unlabelled graphs containing few disjoint cycles

DOI10.1002/rsa.20355zbMath1215.05164OpenAlexW2021469741MaRDI QIDQ3068766

Mihyun Kang, Colin J. H. McDiarmid

Publication date: 17 January 2011

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

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

zbMATH Keywords

blockerdisjoint cyclesunlabelled random graph

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38)

Related Items (4)

Random graphs from a weighted minor-closed class ⋮ On graphs with few disjoint \(t\)-star minors ⋮ Random graphs containing few disjoint excluded minors ⋮ Random Graphs with Few Disjoint Cycles

Cites Work

• The number of trees
• Singularity Analysis of Generating Functions
• Random Graphs from a Minor-Closed Class
• Boltzmann Samplers for the Random Generation of Combinatorial Structures
• On Independent Circuits Contained in a Graph
• Some Results Concerning the Structure of Graphs

This page was built for publication: Random unlabelled graphs containing few disjoint cycles