{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T13:56:20Z","timestamp":1787320580302,"version":"build-2736575974"},"reference-count":12,"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":[[2012,1]]},"abstract":"<jats:p>We say that a k-uniform hypergraph C is a Hamilton cycle of type $\\ell$, for some $1\\leq\\ell\\leq k$, if there exists a cyclic ordering of the vertices of C such that every edge consists of k consecutive vertices, and for every pair of consecutive edges $E_{i-1},E_i$ in C (in the natural ordering of the edges) we have $|E_{i-1}\\setminus E_i|=\\ell$. We define a class of $(\\epsilon,p)$-regular hypergraphs, that includes random hypergraphs, for which we can prove the existence of a decomposition of almost all edges into type $\\ell$ Hamilton cycles, where $\\ell&lt;k\/2$.<\/jats:p>","DOI":"10.1137\/11082378x","type":"journal-article","created":{"date-parts":[[2012,4,4]],"date-time":"2012-04-04T18:33:06Z","timestamp":1333564386000},"page":"435-451","source":"Crossref","is-referenced-by-count":9,"title":["Packing Tight Hamilton Cycles in Uniform Hypergraphs"],"prefix":"10.1137","volume":"26","author":[{"given":"Deepak","family":"Bal","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":[[2012,4,4]]},"reference":[{"key":"R1","doi-asserted-by":"crossref","unstructured":"N. Alon and J. H. Spencer,\n                      The Probabilistic Method\n                      , 2nd ed., John Wiley, New York, 2000.","DOI":"10.1002\/0471722154"},{"key":"R2","unstructured":"D. Christofides, D. K\u00fchn, and D. Osthus,\n                      Edge-Disjoint Hamilton Cycles in Graphs\n                      , preprint, arXiv:0908.4572v1 [Math. CO], 2009."},{"key":"R3","doi-asserted-by":"publisher","DOI":"10.1016\/j.jctb.2004.12.003"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"A. M. Frieze and M. Krivelevich,\n                      Packing Hamilton cycles in random and pseudo-random hypergraphs\n                      , Random Structures Algorithms, to appear. Published online February 5, 2012. DOI: 10.1002\/rsa.20396.","DOI":"10.1002\/rsa.20396"},{"key":"R5","doi-asserted-by":"crossref","unstructured":"A. Frieze, M. Krivelevich, and P.S. Loh,\n                      Packing tight Hamilton cycles in\n                      3\n                      -uniform hypergraphs\n                      , in Proceedings of the Twenty-Second Annual ACM-SIAM Symposium on Discrete Algorithms, D. Randall, ed., ACM, New York, SIAM, Philadelphia, 2011, pp. 913\u2013932.","DOI":"10.1137\/1.9781611973082.71"},{"key":"R6","doi-asserted-by":"crossref","unstructured":"A. M. Frieze and B. Pittel,\n                      Perfect matchings in random graphs with prescribed minimal degree\n                      , in Mathematics and Computer Science. III. Trends Math., Birkh\u00e4user, Basel, 2004, pp. 95\u2013132.","DOI":"10.1007\/978-3-0348-7915-6_11"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"S. Janson, T. \u0141uczak, and A. Ruci\u0144ski,\n                      Random Graphs\n                      , John Wiley, New York, 2000.","DOI":"10.1002\/9781118032718"},{"key":"R8","unstructured":"F. Knox, D. K\u00fchn, and D. Osthus,\n                      Approximate Hamilton Decompositions of Random Graphs\n                      , preprint, arXiv:1006.1268v1 [Math. CO], 2010."},{"key":"R9","unstructured":"F. Knox, D. K\u00fchn, and D. Osthus,\n                      Edge-Disjoint Hamilton Cycles in Random Graphs\n                      , preprint, arXiv:1104.4412v1 [Math. CO], 2011."},{"key":"R10","doi-asserted-by":"publisher","DOI":"10.1006\/jctb.2000.1991"},{"key":"R11","unstructured":"M. Krivelevich and W. Samotij,\n                      Optimal Packings of Hamilton Cycles in Sparse Random Graphs\n                      , preprint, arXiv:1109.5341v1 [Math. CO], 2011."},{"key":"R12","doi-asserted-by":"crossref","unstructured":"C. McDiarmid,\n                      Concentration\n                      , in Probabilistic Methods for Algorithmic Discrete Mathematics, Algorithms Combin. 16, Springer, Berlin, 1998, pp. 195\u2013248.","DOI":"10.1007\/978-3-662-12788-9_6"}],"container-title":["SIAM Journal on Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/epubs.siam.org\/doi\/pdf\/10.1137\/11082378X","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,21]],"date-time":"2026-08-21T12:58:14Z","timestamp":1787317094000},"score":1,"resource":{"primary":{"URL":"https:\/\/epubs.siam.org\/doi\/10.1137\/11082378X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,1]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2012,1]]}},"alternative-id":["10.1137\/11082378X"],"URL":"https:\/\/doi.org\/10.1137\/11082378x","relation":{},"ISSN":["0895-4801","1095-7146"],"issn-type":[{"value":"0895-4801","type":"print"},{"value":"1095-7146","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,1]]}}}