Regular subgraphs of random graphs

DOI10.1002/rsa.20123zbMath1101.05061OpenAlexW4245919572MaRDI QIDQ5486304

Jacques Verstraete, Jeong Han Kim, Béla Bollobás

Publication date: 6 September 2006

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

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

Mathematics Subject Classification ID

Random graphs (graph-theoretic aspects) (05C80)

Related Items (9)

(k+1)-Cores Have k-Factors ⋮ On the number of circuits in random graphs ⋮ Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ Resolution of the Erdős–Sauer problem on regular subgraphs ⋮ On the threshold for \(k\)-regular subgraphs of random graphs ⋮ \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ The Firstk-Regular Subgraph is Large ⋮ The Stripping Process Can be Slow: Part II ⋮ The property of having a k -regular subgraph has a sharp threshold

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Unnamed Item

This page was built for publication: Regular subgraphs of random graphs