Minors in random regular graphs

DOI10.1002/rsa.20285zbMath1201.05086arXiv0803.3001OpenAlexW3083045382MaRDI QIDQ3055786

Deryk Osthus, Nikolaos Fountoulakis, Daniela Kühn

Publication date: 9 November 2010

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

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

zbMATH Keywords

random regular graphsgraph minorsHadwiger number

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80) Graph minors (05C83)

Related Items (7)

Waiter-Client and Client-Waiter planarity, colorability and minor games ⋮ Complete Minors in Graphs Without Sparse Cuts ⋮ Minors in graphs of large \(\theta_r\)-girth ⋮ Rolling backwards can move you forward: On embedding problems in sparse expanders ⋮ Identifying the minor set cover of dense connected bipartite graphs via random matching edge sets ⋮ Even cycle decompositions of 4-regular graphs and line graphs ⋮ Expansion in supercritical random subgraphs of the hypercube and its consequences

Cites Work

• Unnamed Item
• Unnamed Item
• Minors in expanding graphs
• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Hadwiger's conjecture is true for almost every graph
• The asymptotic number of labeled graphs with given degree sequences
• The Evolution of Random Graphs
• Component behavior near the critical point of the random graph process
• Cycles in a random graph near the critical point
• The Structure of a Random Graph at the Point of the Phase Transition
• Random Regular Graphs: Asymptotic Distributions and Contiguity
• The order of the largest complete minor in a random graph

This page was built for publication: Minors in random regular graphs