(k+1)-Cores Have k-Factors

DOI10.1017/S096354831200034XzbMath1252.05198OpenAlexW2032160258MaRDI QIDQ3168446

No author found.

Publication date: 31 October 2012

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

Full work available at URL: https://doi.org/10.1017/s096354831200034x

Mathematics Subject Classification ID

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

Related Items (5)

Threshold functions for small subgraphs in simple graphs and multigraphs ⋮ 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 ⋮ Cores of random graphs are born Hamiltonian

Cites Work

• Sudden emergence of a giant \(k\)-core in a random graph
• On the threshold for \(k\)-regular subgraphs of random graphs
• Regular subgraphs of random graphs
• The Factors of Graphs

This page was built for publication: (k+1)-Cores Have k-Factors