{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,24]],"date-time":"2023-10-24T05:21:51Z","timestamp":1698124911748},"reference-count":6,"publisher":"Wiley","issue":"6","license":[{"start":{"date-parts":[[2006,10,5]],"date-time":"2006-10-05T00:00:00Z","timestamp":1160006400000},"content-version":"vor","delay-in-days":5422,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1991,12]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We determine exactly the expected number of hamilton cycles in the random graph obtained by starting with <jats:italic>n<\/jats:italic> isolated vertices and adding edges at random until each vertex degree is at least two. This complements recent work of Cooper and Frieze. There are similar results concerning expected numbers, for example, of perfect matchings, spanning trees, hamilton paths, and directed hamilton cycles.<\/jats:p>","DOI":"10.1002\/jgt.3190150607","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T06:52:55Z","timestamp":1181285575000},"page":"637-648","source":"Crossref","is-referenced-by-count":1,"title":["Expected numbers at hitting times"],"prefix":"10.1002","volume":"15","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,5]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"173","article-title":"First occurrence of hamilton cycles in random graphs","volume":"27","author":"Ajtai M.","year":"1985","journal-title":"Ann. Discrete Math."},{"key":"e_1_2_1_3_2","first-page":"35","volume-title":"Graph Theory and Combinatorics, Proceedings of Cambridge Combinatorial Conference in Honour of Paul Erd\u00f6s","author":"Bollob\u00e1s B.","year":"1984"},{"key":"e_1_2_1_4_2","volume-title":"Random Graphs","author":"Bollob\u00e1s B.","year":"1985"},{"key":"e_1_2_1_5_2","doi-asserted-by":"publisher","DOI":"10.1002\/jgt.3190130608"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(88)90037-5"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90021-3"}],"container-title":["Journal of Graph Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fjgt.3190150607","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190150607","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T03:25:23Z","timestamp":1698031523000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190150607"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,12]]},"references-count":6,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1991,12]]}},"alternative-id":["10.1002\/jgt.3190150607"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190150607","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1991,12]]}}}