Article contents
(k+1)-Cores Have k-Factors
Published online by Cambridge University Press: 11 September 2012
Abstract
We prove that the threshold for the appearance of a k-regular subgraph in Gn,p is at most the threshold for the appearance of a non-empty (k+1)-core. This improves a result of Pralat, Verstraete and Wormald [5] and proves a conjecture of Bollobás, Kim and Verstraete [3].
Keywords
- Type
- Paper
- Information
- Copyright
- Copyright © Cambridge University Press 2012
References
- 5
- Cited by