The Firstk-Regular Subgraph is Large

DOI10.1017/S0963548314000169zbMath1288.05249arXiv1303.5139MaRDI QIDQ5418809

Pu Gao

Publication date: 28 May 2014

Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)

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

Mathematics Subject Classification ID

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

Related Items (2)

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

Cites Work

• Asymptotic enumeration by degree sequence of graphs with degrees \(o(n^{1/2})\)
• Asymptotic enumeration by degree sequence of graphs of high degree
• Asymptotic enumeration of sparse graphs with a minimum degree constraint
• Sudden emergence of a giant \(k\)-core in a random graph
• On the threshold for \(k\)-regular subgraphs of random graphs
• The property of having a k -regular subgraph has a sharp threshold
• (k+1)-Cores Have k-Factors
• Regular subgraphs of random graphs

This page was built for publication: The Firstk-Regular Subgraph is Large