Regular subgraphs of random graphs

DOI10.1002/RSA.20123zbMATH Open1101.05061OpenAlexW4245919572MaRDI QIDQ5486304FDOQ5486304

Authors: Béla Bollobás, Jeong Han Kim, J. Verstraëte 

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

Recommendations

• On the threshold for \(k\)-regular subgraphs of random graphs
• \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
• (k+1)-Cores Have k-Factors
• The property of having a \(k\)-regular subgraph has a sharp threshold
• The first \(k\)-regular subgraph is large

Mathematics Subject Classification ID

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

Cites Work

• A probabilistic proof of an asymptotic formula for the number of labelled regular graphs
• Graph theory with applications

Cited In (18)

• \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph
• On the threshold for \(k\)-regular subgraphs of random graphs
• Title not available (Why is that?)
• Title not available (Why is that?)
• Title not available (Why is that?)
• Small subgraphs of random regular graphs
• The property of having a \(k\)-regular subgraph has a sharp threshold
• Random subgraphs in Cartesian powers of regular graphs
• On the number of circuits in random graphs
• (k+1)-Cores Have k-Factors
• Resolution of the Erdős–Sauer problem on regular subgraphs
• Threshold functions for small subgraphs in simple graphs and multigraphs
• Subgraphs of random match-graphs
• Connected balanced subgraphs in random regular multigraphs under the configuration model
• Regular graphs whose subgraphs tend to be acyclic
• The stripping process can be slow. II
• Subgraphs of Random Graphs
• The first \(k\)-regular subgraph is large

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

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