{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,21]],"date-time":"2026-04-21T14:24:19Z","timestamp":1776781459271,"version":"3.51.2"},"reference-count":0,"publisher":"The Electronic Journal of Combinatorics","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Electron. J. Combin."],"abstract":"<jats:p>We show that the probability that a random graph $G\\sim G(n,p)$ contains no Hamilton cycle is $(1+o(1))Pr(\\delta (G) &lt; 2)$ for all values of $p = p(n)$. We also prove an analogous result for perfect matchings.<\/jats:p>","DOI":"10.37236\/8339","type":"journal-article","created":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T09:18:40Z","timestamp":1579857520000},"source":"Crossref","is-referenced-by-count":3,"title":["Random Graph's Hamiltonicity is Strongly Tied to its Minimum Degree"],"prefix":"10.37236","volume":"27","author":[{"given":"Yahav","family":"Alon","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael","family":"Krivelevich","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"23455","published-online":{"date-parts":[[2020,1,24]]},"container-title":["The Electronic Journal of Combinatorics"],"original-title":[],"link":[{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p30\/8017","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/download\/v27i1p30\/8017","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,24]],"date-time":"2020-01-24T09:18:40Z","timestamp":1579857520000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.combinatorics.org\/ojs\/index.php\/eljc\/article\/view\/v27i1p30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,1,24]]},"references-count":0,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2020,1,9]]}},"URL":"https:\/\/doi.org\/10.37236\/8339","relation":{},"ISSN":["1077-8926"],"issn-type":[{"value":"1077-8926","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,1,24]]},"article-number":"P1.30"}}