{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,30]],"date-time":"2026-04-30T15:18:44Z","timestamp":1777562324807,"version":"3.51.4"},"reference-count":8,"publisher":"Cambridge University Press (CUP)","issue":"6","license":[{"start":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T00:00:00Z","timestamp":1347321600000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2012,11]]},"abstract":"<jats:p>We prove that the threshold for the appearance of a <jats:italic>k<\/jats:italic>-regular subgraph in <jats:italic>G<\/jats:italic><jats:sub><jats:italic>n<\/jats:italic>,<jats:italic>p<\/jats:italic><\/jats:sub> is at most the threshold for the appearance of a non-empty (<jats:italic>k<\/jats:italic>+1)-core. This improves a result of Pralat, Verstraete and Wormald [5] and proves a conjecture of Bollob\u00e1s, Kim and Verstraete [3].<\/jats:p>","DOI":"10.1017\/s096354831200034x","type":"journal-article","created":{"date-parts":[[2012,9,11]],"date-time":"2012-09-11T09:44:12Z","timestamp":1347356652000},"page":"882-896","source":"Crossref","is-referenced-by-count":5,"title":["(<i>k<\/i>+1)-Cores Have <i>k<\/i>-Factors"],"prefix":"10.1017","volume":"21","author":[{"given":"SIU ON","family":"CHAN","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL","family":"MOLLOY","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2012,9,11]]},"reference":[{"key":"S096354831200034X_ref8","volume-title":"Introduction to Graph Theory","author":"West","year":"2001"},{"key":"S096354831200034X_ref7","doi-asserted-by":"publisher","DOI":"10.4153\/CJM-1952-028-2"},{"key":"S096354831200034X_ref1","unstructured":"Benjamini I. , Kozma G. and Wormald N. (2006) The mixing time of the giant component of a random graph. Preprint, arXiv:math\/0610459"},{"key":"S096354831200034X_ref6","doi-asserted-by":"publisher","DOI":"10.1209\/epl\/i2006-10070-4"},{"key":"S096354831200034X_ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1996.0036"},{"key":"S096354831200034X_ref3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20123"},{"key":"S096354831200034X_ref2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511814068"},{"key":"S096354831200034X_ref5","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-011-2545-3"}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354831200034X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,24]],"date-time":"2019-04-24T21:59:44Z","timestamp":1556143184000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354831200034X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,9,11]]},"references-count":8,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2012,11]]}},"alternative-id":["S096354831200034X"],"URL":"https:\/\/doi.org\/10.1017\/s096354831200034x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,9,11]]}}}