Loading...
Please wait, while we are loading the content...
Similar Documents
(k+1)-Cores Have k-Factors
| Content Provider | Scilit |
|---|---|
| Author | Molloy, Michael |
| Copyright Year | 2012 |
| Description | We prove that the threshold for the appearance of a k-regular subgraph in $G_{n,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]. |
| Related Links | http://pdfs.semanticscholar.org/1e74/b8b7223b21733a68f9049b886e1fda6eeb04.pdf https://www.cambridge.org/core/services/aop-cambridge-core/content/view/44E0D0C17765B584C9D93532A79F71B4/S096354831200034Xa.pdf/div-class-title-span-class-italic-k-span-1-cores-have-span-class-italic-k-span-factors-div.pdf |
| Ending Page | 896 |
| Page Count | 15 |
| Starting Page | 882 |
| ISSN | 09635483 |
| e-ISSN | 14692163 |
| DOI | 10.1017/s096354831200034x |
| Journal | Combinatorics, Probability and Computing |
| Issue Number | 6 |
| Volume Number | 21 |
| Language | English |
| Publisher | Cambridge University Press (CUP) |
| Publisher Date | 2012-09-11 |
| Access Restriction | Open |
| Subject Keyword | Combinatorics, Probability and Computing |
| Content Type | Text |
| Resource Type | Article |
| Subject | Applied Mathematics Statistics and Probability Theoretical Computer Science Computational Theory and Mathematics |