Regular induced subgraphs of a random Graph

DOI10.1002/rsa.20324zbMath1223.05278arXiv0808.2023OpenAlexW2003634762MaRDI QIDQ2998889

Michael Krivelevich, Nicholas C. Wormald, Benjamin Sudakov

Publication date: 11 May 2011

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

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

zbMATH Keywords

random regular graphsrandom graphextremal graph theoryregular induced subgraph

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Random graphs (graph-theoretic aspects) (05C80)

Related Items

Induced subgraphs in sparse random graphs with given degree sequences ⋮ Induced subgraphs with many repeated degrees

Cites Work

• Kolmogorov random graphs only have trivial stable colorings.
• Asymptotic enumeration by degree sequence of graphs of high degree
• Random regular graphs of high degree
• Large Nearly Regular Induced Subgraphs
• The Numbers of Spanning Trees, Hamilton Cycles and Perfect Matchings in a Random Graph
• Spanning Subgraphs of Random Graphs