{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,29]],"date-time":"2025-12-29T11:35:59Z","timestamp":1767008159563},"reference-count":15,"publisher":"Cambridge University Press (CUP)","issue":"4","license":[{"start":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T00:00:00Z","timestamp":1521676800000},"content-version":"unspecified","delay-in-days":0,"URL":"https:\/\/www.cambridge.org\/core\/terms"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Combinator. Probab. Comp."],"published-print":{"date-parts":[[2018,7]]},"abstract":"<jats:p>It is known that w.h.p. the hitting time \u03c4<jats:sub>2\u03c3<\/jats:sub> for the random graph process to have minimum degree 2\u03c3 coincides with the hitting time for \u03c3 edge-disjoint Hamilton cycles [4, 9, 13]. In this paper we prove an online version of this property. We show that, for a fixed integer \u03c3 \u2a7e 2, if random edges of <jats:italic>K<jats:sub>n<\/jats:sub><\/jats:italic> are presented one by one then w.h.p. it is possible to colour the edges online with \u03c3 colours so that at time \u03c4<jats:sub>2\u03c3<\/jats:sub> each colour class is Hamiltonian.<\/jats:p>","DOI":"10.1017\/s0963548318000159","type":"journal-article","created":{"date-parts":[[2018,3,22]],"date-time":"2018-03-22T02:30:29Z","timestamp":1521685829000},"page":"475-495","source":"Crossref","is-referenced-by-count":2,"title":["Packing Hamilton Cycles Online"],"prefix":"10.1017","volume":"27","author":[{"given":"JOSEPH","family":"BRIGGS","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"ALAN","family":"FRIEZE","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"MICHAEL","family":"KRIVELEVICH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"PO-SHEN","family":"LOH","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"BENNY","family":"SUDAKOV","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"56","published-online":{"date-parts":[[2018,3,22]]},"reference":[{"key":"S0963548318000159_ref9","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20510"},{"key":"S0963548318000159_ref14","doi-asserted-by":"publisher","DOI":"10.1017\/S096354831200020X"},{"key":"S0963548318000159_ref7","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781316339831"},{"key":"S0963548318000159_ref5","first-page":"17","article-title":"On the evolution of random graphs.","volume":"5A","author":"Erd\u0151s","year":"1960","journal-title":"Publ. Math. Inst. Hung. Acad. Sci."},{"key":"S0963548318000159_ref15","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(76)90068-6"},{"key":"S0963548318000159_ref13","doi-asserted-by":"publisher","DOI":"10.1137\/110849171"},{"key":"S0963548318000159_ref1","first-page":"173","volume-title":"Cycles in Graphs","author":"Ajtai","year":"1985"},{"key":"S0963548318000159_ref2","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20343"},{"key":"S0963548318000159_ref3","unstructured":"Bollob\u00e1s B. (1984) The evolution of sparse graphs. In Graph Theory and Combinatorics: Proceedings of the Cambridge Combinatorial Conference in Honour of Paul Erd\u0151s ( B. Bollob\u00e1s , ed.), pp. 35\u201357."},{"key":"S0963548318000159_ref6","first-page":"261","article-title":"On the strength of connectedness of a random graph.","volume":"8","author":"Erd\u0151s","year":"1961","journal-title":"Acta. Math. Acad. Sci. Hungar."},{"key":"S0963548318000159_ref8","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"S0963548318000159_ref10","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(83)90021-3"},{"key":"S0963548318000159_ref11","first-page":"760","article-title":"Solution of a problem of Erd\u0151s and R\u00e9nyi on Hamilton cycles in non-oriented graphs.","volume":"17","author":"Korshunov","year":"1976","journal-title":"Soviet Math. Dokl."},{"key":"S0963548318000159_ref12","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20302"},{"key":"S0963548318000159_ref4","first-page":"23","article-title":"On matchings and Hamiltonian cycles in random graphs.","volume":"28","author":"Bollob\u00e1s","year":"1985","journal-title":"Ann. Discrete Math."}],"container-title":["Combinatorics, Probability and Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.cambridge.org\/core\/services\/aop-cambridge-core\/content\/view\/S0963548318000159","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T19:06:08Z","timestamp":1555268768000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.cambridge.org\/core\/product\/identifier\/S0963548318000159\/type\/journal_article"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,3,22]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2018,7]]}},"alternative-id":["S0963548318000159"],"URL":"https:\/\/doi.org\/10.1017\/s0963548318000159","relation":{},"ISSN":["0963-5483","1469-2163"],"issn-type":[{"value":"0963-5483","type":"print"},{"value":"1469-2163","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018,3,22]]}}}