Random unlabelled graphs containing few disjoint cycles

DOI10.1002/RSA.20355MaRDI QIDQ3068766zbMATH OpenOpenAlexFDO

Authors Mihyun Kang, Colin 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

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

Recommendations

• Random graphs with few disjoint cycles
• Quadratic upper bounds on the Erdős--Pósa property for a generalization of packing and covering cycles
• Random graphs containing few disjoint excluded minors
• scientific article; zbMATH DE number 147631
• scientific article; zbMATH DE number 1416474

Cites work

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

Cited in

(6)

• On the structure of random unlabelled acyclic graphs.
• Random graphs with few disjoint cycles
• Random graphs from a weighted minor-closed class
• Cycles and Unicyclic Components in Random Graphs
• Random graphs containing few disjoint excluded minors
• On graphs with few disjoint \(t\)-star minors

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3068766)