{"id":"https://openalex.org/W2482600013","doi":"https://doi.org/10.1017/s0963548317000402","title":"Packing Loose Hamilton Cycles","display_name":"Packing Loose Hamilton Cycles","publication_year":2017,"publication_date":"2017-08-01","ids":{"openalex":"https://openalex.org/W2482600013","doi":"https://doi.org/10.1017/s0963548317000402","mag":"2482600013"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548317000402","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000402","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3605ADC21B383BA7ADF896CFFB1BC02/S0963548317000402a.pdf/div-class-title-packing-loose-hamilton-cycles-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"type":"preprint","indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3605ADC21B383BA7ADF896CFFB1BC02/S0963548317000402a.pdf/div-class-title-packing-loose-hamilton-cycles-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111429254","display_name":"Asaf Ferber","orcid":"https://orcid.org/0000-0002-0568-4523"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"ASAF FERBER","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5051623875","display_name":"Kyle Luh","orcid":"https://orcid.org/0000-0002-1822-3443"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"KYLE LUH","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026513133","display_name":"Daniel Montealegre","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"DANIEL MONTEALEGRE","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5049907101","display_name":"Hoi H. Nguyen","orcid":"https://orcid.org/0000-0002-4590-9301"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"OANH NGUYEN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5111429254"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.05659745,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"26","issue":"6","first_page":"839","last_page":"849"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/2607","display_name":"Discrete Mathematics and Combinatorics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.998199999332428,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11830","display_name":"Point processes and geometric inequalities","score":0.9958999752998352,"subfield":{"id":"https://openalex.org/subfields/2604","display_name":"Applied Mathematics"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.8762444257736206},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8650292158126831},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6748936772346497},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6188094615936279},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6110132336616516},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5356440544128418},{"id":"https://openalex.org/keywords/binomial","display_name":"Binomial (polynomial)","score":0.5186392664909363},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.46766626834869385},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3762468099594116},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0685456395149231}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8762444257736206},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8650292158126831},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6748936772346497},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6188094615936279},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6110132336616516},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5356440544128418},{"id":"https://openalex.org/C2781315470","wikidata":"https://www.wikidata.org/wiki/Q193623","display_name":"Binomial (polynomial)","level":2,"score":0.5186392664909363},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.46766626834869385},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3762468099594116},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0685456395149231},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1017/s0963548317000402","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000402","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3605ADC21B383BA7ADF896CFFB1BC02/S0963548317000402a.pdf/div-class-title-packing-loose-hamilton-cycles-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:1608.01278","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1608.01278","pdf_url":"https://arxiv.org/pdf/1608.01278","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":null},{"id":"mag:2482600013","is_oa":true,"landing_page_url":"https://arxiv.org/pdf/1608.01278","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"arXiv (Cornell University)","raw_type":null},{"id":"doi:10.48550/arxiv.1608.01278","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.1608.01278","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1017/s0963548317000402","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000402","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/C3605ADC21B383BA7ADF896CFFB1BC02/S0963548317000402a.pdf/div-class-title-packing-loose-hamilton-cycles-div.pdf","source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2482600013.pdf","grobid_xml":"https://content.openalex.org/works/W2482600013.grobid-xml"},"referenced_works_count":13,"referenced_works":["https://openalex.org/W1486613786","https://openalex.org/W2010688605","https://openalex.org/W2066266229","https://openalex.org/W2105714926","https://openalex.org/W2119368576","https://openalex.org/W2126781761","https://openalex.org/W2140606499","https://openalex.org/W2167097471","https://openalex.org/W2469996778","https://openalex.org/W2950595488","https://openalex.org/W2951212467","https://openalex.org/W2963630205","https://openalex.org/W4241684091"],"related_works":["https://openalex.org/W2951212467","https://openalex.org/W3098804474","https://openalex.org/W2119368576","https://openalex.org/W3158230343","https://openalex.org/W3205558229","https://openalex.org/W2144292514","https://openalex.org/W2781836333","https://openalex.org/W3208926416","https://openalex.org/W2964065454","https://openalex.org/W2256948834","https://openalex.org/W2952796980","https://openalex.org/W2032085740","https://openalex.org/W3182821399","https://openalex.org/W3211295418","https://openalex.org/W1630514295","https://openalex.org/W2963404187","https://openalex.org/W2994191279","https://openalex.org/W2963358149","https://openalex.org/W2952049266","https://openalex.org/W3015052924"],"abstract_inverted_index":{"A":[0],"subset":[1],"C":[2,17,38,185],"of":[3,22,30,41,100,129,132,216],"edges":[4,36,50],"in":[5,37,137],"a":[6,12,27,133,173,192],"k":[7,58,62,79,139,189,194,198],"-uniform":[8,59,195],"hypergraph":[9,60,196],"H":[10,23,61,138,197],"is":[11,123,141],"loose":[13,103,134,206],"Hamilton":[14,104,135,207],"cycle":[15,136],"if":[16],"covers":[18],"all":[19,107],"the":[20,35,98,117,126,130,144,149,168,214,224],"vertices":[21,32],"and":[24,44,70,166,212,223],"there":[25],"exists":[26],"cyclic":[28],"ordering":[29],"these":[31],"such":[33,45],"that":[34,42,46,125],"are":[39,152],"segments":[40],"order":[43],"every":[47],"two":[48],"consecutive":[49],"share":[51],"exactly":[52],"one":[53],"vertex.":[54],"The":[55],"binomial":[56],"random":[57,193],"n,p":[63,140,199],"has":[64],"vertex":[65],"set":[66,73],"[":[67],"n":[68,157,159,175,186,188],"]":[69],"an":[71],"edge":[72],"E":[74,87,111],"obtained":[75],"by":[76,221],"adding":[77],"each":[78],"-tuple":[80],"e":[81],"\u2208":[82],"(":[83],"$\\binom{[n]}{k}$":[84],")":[85,176],"to":[86,115,172],"with":[88,200],"probability":[89,128,202],"p":[90,154,182],",":[91,191],"independently":[92],"at":[93],"random.":[94],"Here":[95,161],"we":[96,162],"consider":[97],"problem":[99,119,151],"finding":[101],"edge-disjoint":[102,205],"cycles":[105],"covering":[106],"but":[108],"o":[109],"(|":[110],"|)":[112],"edges,":[113],"referred":[114],"as":[116],"packing":[118,150],".":[120,160],"While":[121],"it":[122],"known":[124,146],"threshold":[127],"appearance":[131],"$p=\\Theta\\biggl(\\frac{\\log":[142],"n}{n^{k-1}}\\biggr),$":[143],"best":[145,178],"bounds":[147],"for":[148,181],"around":[153],"=":[155],"polylog(":[156,174],")/":[158],"make":[163],"substantial":[164],"progress":[165],"prove":[167],"following":[169],"asymptotically":[170],"(up":[171],"factor)":[177],"possible":[179],"result:":[180],"\u2265":[183],"log":[184],"/":[187],"\u22121":[190],"high":[201],"contains":[203],"$N:=(1-o(1))\\frac{\\binom{n}{k}p}{n/(k-1)}$":[204],"cycles.":[208],"Our":[209],"proof":[210],"utilizes":[211],"modifies":[213],"idea":[215],"\u2018online":[217],"sprinkling\u2019":[218],"recently":[219],"introduced":[220],"Vu":[222],"first":[225],"author.":[226]},"counts_by_year":[],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}