{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T13:42:25Z","timestamp":1698068545890},"reference-count":7,"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":6152,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Graph Theory"],"published-print":{"date-parts":[[1989,12]]},"abstract":"Abstract<\/jats:title>Let a random graph G<\/jats:italic> be constructed by adding random edges one by one, starting with n<\/jats:italic> isolated vertices. We show that with probability going to one as n<\/jats:italic> goes to infinity, when G<\/jats:italic> first has minimum degree two, it has at least (log n<\/jats:italic>) distinct hamilton cycles for any fixed \u03f5>0.<\/jats:p>","DOI":"10.1002\/jgt.3190130608","type":"journal-article","created":{"date-parts":[[2007,6,8]],"date-time":"2007-06-08T22:52:46Z","timestamp":1181343166000},"page":"719-735","source":"Crossref","is-referenced-by-count":10,"title":["On the number of hamilton cycles in a random graph"],"prefix":"10.1002","volume":"13","author":[{"given":"C.","family":"Cooper","sequence":"first","affiliation":[]},{"given":"A. M.","family":"Frieze","sequence":"additional","affiliation":[]}],"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.1007\/BF02066689"},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90046-8"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(85)80046-9"},{"key":"e_1_2_1_8_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.3190130608","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/jgt.3190130608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,22]],"date-time":"2023-10-22T02:57:33Z","timestamp":1697943453000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/jgt.3190130608"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,12]]},"references-count":7,"journal-issue":{"issue":"6","published-print":{"date-parts":[[1989,12]]}},"alternative-id":["10.1002\/jgt.3190130608"],"URL":"https:\/\/doi.org\/10.1002\/jgt.3190130608","archive":["Portico"],"relation":{},"ISSN":["0364-9024","1097-0118"],"issn-type":[{"value":"0364-9024","type":"print"},{"value":"1097-0118","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,12]]}}}