The property of having a k -regular subgraph has a sharp threshold

DOI10.1002/rsa.20434zbMath1269.05100arXiv1310.5141OpenAlexW2963722683MaRDI QIDQ2841681

Shoham Letzter

Publication date: 26 July 2013

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

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

zbMATH Keywords

random graphsregular graphssharp threshold

Mathematics Subject Classification ID

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

Related Items (3)

Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ \(k\)-regular subgraphs near the \(k\)-core threshold of a random graph ⋮ The Firstk-Regular Subgraph is Large

Cites Work

• Unnamed Item
• Sudden emergence of a giant \(k\)-core in a random graph
• Global wellposedness of defocusing critical nonlinear Schrödinger equation in the radial case
• Sharp thresholds of graph properties, and the $k$-sat problem
• Hunting for sharp thresholds
• Regular subgraphs of random graphs

This page was built for publication: The property of having a k -regular subgraph has a sharp threshold