{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,29]],"date-time":"2026-09-29T00:45:37Z","timestamp":1790642737951,"version":"4.1.0"},"reference-count":13,"publisher":"Society for Industrial & Applied Mathematics (SIAM)","issue":"2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["SIAM J. Discrete Math."],"published-print":{"date-parts":[[2008,1]]},"abstract":"<jats:p>An n-lift of a digraph K is a digraph with a vertex set $V(K)\\times [n]$, and for each directed edge $(i,j)\\in E(K)$ there is a perfect matching between fibers $\\{i\\}\\times [n]$ and $\\{j\\}\\times [n]$, with edges directed from fiber i to fiber j. If these matchings are chosen independently and uniformly at random, then we say that we have a random n-lift. We show that if h is sufficiently large, then a random n-lift of the complete digraph $\\DK_h$ is a Hamiltonian .<\/jats:p>","DOI":"10.1137\/060670808","type":"journal-article","created":{"date-parts":[[2008,3,20]],"date-time":"2008-03-20T18:03:58Z","timestamp":1206036238000},"page":"520-540","source":"Crossref","is-referenced-by-count":3,"title":["Hamilton Cycles in Random Lifts of Directed Graphs"],"prefix":"10.1137","volume":"22","author":[{"given":"Prasad","family":"Chebolu","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Alan","family":"Frieze","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"351","published-online":{"date-parts":[[2008,3,20]]},"reference":[{"key":"R1","doi-asserted-by":"publisher","DOI":"10.1007\/s004930200000"},{"key":"R2","doi-asserted-by":"publisher","DOI":"10.1017\/S0963548305007273"},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.10003"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"B. Bollob\u00e1s,\n                      Random Graphs\n                      , 2nd ed., Cambridge University Press, Cambridge, UK, 2001.","DOI":"10.1017\/CBO9780511814068"},{"key":"R5","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejc.2006.05.005"},{"key":"R6","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.1994.1060"},{"key":"R7","doi-asserted-by":"publisher","DOI":"10.1002\/1098-2418(200007)16:4<369::AID-RSA6>3.0.CO;2-J"},{"key":"R8","doi-asserted-by":"publisher","DOI":"10.1017\/S096354830000095X"},{"key":"R9","doi-asserted-by":"publisher","DOI":"10.1137\/S009753979426112X"},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579431"},{"key":"R11","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539792235384"},{"key":"R12","unstructured":"V. F. Kolchin,\n                      Random Mappings\n                      , Optimization Software Inc., New York, 1986."},{"key":"R13","doi-asserted-by":"publisher","DOI":"10.1007\/s00493-005-0024-8"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/060670808","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T14:01:45Z","timestamp":1787320905000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/060670808"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,1]]},"references-count":13,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2008,1]]}},"alternative-id":["10.1137\/060670808"],"URL":"https:\/\/doi.org\/10.1137\/060670808","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,1]]}}}