{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,1,25]],"date-time":"2024-01-25T12:24:18Z","timestamp":1706185458019},"reference-count":9,"publisher":"Cambridge University Press (CUP)","issue":"1","license":[{"start":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T00:00:00Z","timestamp":1221177600000},"content-version":"unspecified","delay-in-days":5309,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[1994,3]]},"abstract":"<jats:p>We prove that almost every <jats:italic>r<\/jats:italic>-regular digraph is Hamiltonian for all fixed <jats:italic>r<\/jats:italic> \u2265 3.<\/jats:p>","DOI":"10.1017\/s096354830000095x","type":"journal-article","created":{"date-parts":[[2008,9,12]],"date-time":"2008-09-12T11:16:59Z","timestamp":1221218219000},"page":"39-49","source":"Crossref","is-referenced-by-count":14,"title":["Hamilton Cycles in Random Regular Digraphs"],"prefix":"10.1017","volume":"3","author":[{"given":"Colin","family":"Cooper","sequence":"first","affiliation":[]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[]},{"given":"Michael","family":"Molloy","sequence":"additional","affiliation":[]}],"member":"56","published-online":{"date-parts":[[2008,9,12]]},"reference":[{"key":"S096354830000095X_ref006","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(88)90089-5"},{"key":"S096354830000095X_ref001","doi-asserted-by":"publisher","DOI":"10.1016\/0097-3165(78)90059-6"},{"key":"S096354830000095X_ref003","volume-title":"Random graphs","author":"Bollob\u00e1s","year":"1983"},{"key":"S096354830000095X_ref005","doi-asserted-by":"publisher","DOI":"10.1016\/0095-8956(84)90066-2"},{"key":"S096354830000095X_ref002","doi-asserted-by":"publisher","DOI":"10.1016\/S0195-6698(83)80039-0"},{"key":"S096354830000095X_ref004","unstructured":"[4] Cooper C. and Frieze A. M. (to appear) Hamilton cycles in a class of random digraphs."},{"key":"S096354830000095X_ref007","volume-title":"Random mappings","author":"Kolchin","year":"1986"},{"key":"S096354830000095X_ref008","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.3240030202"},{"key":"S096354830000095X_ref009","unstructured":"[9] Robinson R. W. and Wormald N. C. (to appear) Almost all regular graphs are Hamiltonian, Random Structures and Algorithms."}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S096354830000095X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:08:54Z","timestamp":1557947334000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S096354830000095X\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,3]]},"references-count":9,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1994,3]]}},"alternative-id":["S096354830000095X"],"URL":"https:\/\/doi.org\/10.1017\/s096354830000095x","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[1994,3]]}}}