Random Graphs with Few Disjoint Cycles

DOI10.1017/S0963548311000186zbMath1238.05249arXiv1010.6278OpenAlexW2052068320MaRDI QIDQ3103626

Valentas Kurauskas, Colin J. H. McDiarmid

Publication date: 8 December 2011

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

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

zbMATH Keywords

connectivitychromatic numberclique numberrandom graphforestblockerdisjoint cycles

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Paths and cycles (05C38) Vertex subsets with special properties (dominating sets, independent sets, cliques, etc.) (05C69) Connectivity (05C40)

Related Items (5)

Maximum degree in minor-closed classes of graphs ⋮ Random graphs from a weighted minor-closed class ⋮ On graphs with few disjoint \(t\)-star minors ⋮ Random graphs containing few disjoint excluded minors ⋮ Subcritical Graph Classes Containing All Planar Graphs

Cites Work

• Unnamed Item
• Graph minors. V. Excluding a planar graph
• Packing directed circuits
• Random planar graphs
• Random unlabelled graphs containing few disjoint cycles
• Random Graphs from a Minor-Closed Class
• On Independent Circuits Contained in a Graph
• Chromatic Number and Topological Complete Subgraphs

This page was built for publication: Random Graphs with Few Disjoint Cycles