{"id":"https://openalex.org/W1976828176","doi":"https://doi.org/10.1137/11082378x","title":"Packing Tight Hamilton Cycles in Uniform Hypergraphs","display_name":"Packing Tight Hamilton Cycles in Uniform Hypergraphs","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W1976828176","doi":"https://doi.org/10.1137/11082378x","mag":"1976828176"},"language":"en","primary_location":{"id":"doi:10.1137/11082378x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11082378x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/Packing_tight_Hamilton_cycles_in_3-uniform_hypergraphs/6479093","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5028085743","display_name":"Deepak Bal","orcid":"https://orcid.org/0000-0003-1441-1823"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Deepak Bal","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5028085743"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":3.4952,"has_fulltext":true,"cited_by_count":20,"citation_normalized_percentile":{"value":0.92750709,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"26","issue":"2","first_page":"435","last_page":"451"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11797","display_name":"graph theory and CDMA systems","score":0.989799976348877,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9807999730110168,"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/T10849","display_name":"Finite Group Theory Research","score":0.9743000268936157,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.9014202356338501},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8658269643783569},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8440302610397339},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.5634279251098633},{"id":"https://openalex.org/keywords/class","display_name":"Class (philosophy)","score":0.45777177810668945},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.45149677991867065},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.39903703331947327}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9014202356338501},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8658269643783569},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8440302610397339},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.5634279251098633},{"id":"https://openalex.org/C2777212361","wikidata":"https://www.wikidata.org/wiki/Q5127848","display_name":"Class (philosophy)","level":2,"score":0.45777177810668945},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.45149677991867065},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.39903703331947327},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":10,"locations":[{"id":"doi:10.1137/11082378x","is_oa":false,"landing_page_url":"https://doi.org/10.1137/11082378x","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"},{"id":"pmh:oai:figshare.com:article/6479093","is_oa":true,"landing_page_url":null,"pdf_url":"https://figshare.com/articles/Packing_tight_Hamilton_cycles_in_3-uniform_hypergraphs/6479093","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:figshare.com:article/6479096","is_oa":true,"landing_page_url":"https://figshare.com/articles/journal_contribution/Packing_Tight_Hamilton_Cycles_in_Uniform_Hypergraphs/6479096","pdf_url":"https://figshare.com/articles/Packing_Tight_Hamilton_Cycles_in_Uniform_Hypergraphs/6479096","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},{"id":"pmh:oai:repository.cmu.edu:math-1782","is_oa":false,"landing_page_url":"http://repository.cmu.edu/math/776","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Department of Mathematical Sciences","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.190.581","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.190.581","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/%7Eaf1p/Texfiles/Packhamk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.300.4865","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.4865","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/~af1p/Texfiles/Packhamk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.303.7365","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.303.7365","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.cmu.edu/%7Eaf1p/Texfiles/Packhamk.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.743.4568","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.743.4568","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://arxiv.org/pdf/1102.1488.pdf","raw_type":"text"},{"id":"doi:10.1184/r1/6479093.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6479093.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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-journal"},{"id":"doi:10.1184/r1/6479096.v1","is_oa":true,"landing_page_url":"https://doi.org/10.1184/r1/6479096.v1","pdf_url":null,"source":{"id":"https://openalex.org/S7407050927","display_name":"KiltHub Repository","issn_l":null,"issn":[],"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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-journal"}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/6479093","is_oa":true,"landing_page_url":null,"pdf_url":"https://figshare.com/articles/Packing_tight_Hamilton_cycles_in_3-uniform_hypergraphs/6479093","source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4329546715","display_name":"Random Graphs: Structure and Algorithms","funder_award_id":"0753472","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G848032724","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1976828176.pdf","grobid_xml":"https://content.openalex.org/works/W1976828176.grobid-xml"},"referenced_works_count":2,"referenced_works":["https://openalex.org/W2053929306","https://openalex.org/W2140606499"],"related_works":["https://openalex.org/W4376608589","https://openalex.org/W3138003926","https://openalex.org/W4300037846","https://openalex.org/W1630514295","https://openalex.org/W1537073411","https://openalex.org/W2963081352","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W2472555608","https://openalex.org/W4214498971"],"abstract_inverted_index":{"We":[0,59],"say":[1],"that":[2,30,66],"a":[3,8,21,61,78],"k-uniform":[4],"hypergraph":[5],"C":[6,28,47],"is":[7],"Hamilton":[9,87],"cycle":[10],"of":[11,24,27,34,42,52,63,77,80],"type":[12,85],"$\\ell$,":[13],"for":[14,39,70],"some":[15],"$1\\leq\\ell\\leq":[16],"k$,":[17],"if":[18],"there":[19],"exists":[20],"cyclic":[22],"ordering":[23,51],"the":[25,49,53,75],"vertices":[26],"such":[29],"every":[31,40],"edge":[32],"consists":[33],"k":[35],"consecutive":[36,43],"vertices,":[37],"and":[38],"pair":[41],"edges":[44,83],"$E_{i-1},E_i$":[45],"in":[46],"(in":[48],"natural":[50],"edges)":[54],"we":[55,72],"have":[56],"$|E_{i-1}\\setminus":[57],"E_i|=\\ell$.":[58],"define":[60],"class":[62],"$(\\epsilon,p)$-regular":[64],"hypergraphs,":[65,69],"includes":[67],"random":[68],"which":[71],"can":[73],"prove":[74],"existence":[76],"decomposition":[79],"almost":[81],"all":[82],"into":[84],"$\\ell$":[86],"cycles,":[88],"where":[89],"$\\ell<k/2$.":[90]},"counts_by_year":[{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":4},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}