{"id":"https://openalex.org/W2951212467","doi":"https://doi.org/10.37236/535","title":"Loose Hamilton Cycles in Random Uniform Hypergraphs","display_name":"Loose Hamilton Cycles in Random Uniform Hypergraphs","publication_year":2011,"publication_date":"2011-02-21","ids":{"openalex":"https://openalex.org/W2951212467","doi":"https://doi.org/10.37236/535","mag":"2951212467"},"language":"en","primary_location":{"id":"doi:10.37236/535","is_oa":true,"landing_page_url":"https://doi.org/10.37236/535","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p48/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p48/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5048565272","display_name":"Andrzej Dudek","orcid":"https://orcid.org/0000-0002-6410-5413"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Andrzej Dudek","raw_affiliation_strings":["Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5056950019","display_name":"Alan Frieze","orcid":"https://orcid.org/0000-0002-8481-5615"},"institutions":[{"id":"https://openalex.org/I74973139","display_name":"Carnegie Mellon University","ror":"https://ror.org/05x2bcf33","country_code":"US","type":"education","lineage":["https://openalex.org/I74973139"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alan Frieze","raw_affiliation_strings":["Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213"],"affiliations":[{"raw_affiliation_string":"Department of Mathematical Sciences Carnegie Mellon University Pittsburgh, PA 15213","institution_ids":["https://openalex.org/I74973139"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5048565272"],"corresponding_institution_ids":["https://openalex.org/I74973139"],"apc_list":null,"apc_paid":null,"fwci":4.0325,"has_fulltext":true,"cited_by_count":37,"citation_normalized_percentile":{"value":0.94326683,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":99},"biblio":{"volume":"18","issue":"1","first_page":null,"last_page":null},"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.9998000264167786,"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.9998000264167786,"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/T11269","display_name":"Algorithms and Data Compression","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9886000156402588,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.9095802307128906},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8844870328903198},{"id":"https://openalex.org/keywords/hypergraph","display_name":"Hypergraph","score":0.7381160259246826},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.6261252760887146},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.6132103204727173},{"id":"https://openalex.org/keywords/infinity","display_name":"Infinity","score":0.5274237394332886},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.5046061277389526},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3352086544036865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.1517728865146637},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.10006332397460938}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.9095802307128906},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8844870328903198},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.7381160259246826},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.6261252760887146},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.6132103204727173},{"id":"https://openalex.org/C7321624","wikidata":"https://www.wikidata.org/wiki/Q205","display_name":"Infinity","level":2,"score":0.5274237394332886},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.5046061277389526},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3352086544036865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.1517728865146637},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.10006332397460938},{"id":"https://openalex.org/C10138342","wikidata":"https://www.wikidata.org/wiki/Q43015","display_name":"Finance","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/535","is_oa":true,"landing_page_url":"https://doi.org/10.37236/535","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p48/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"}],"best_oa_location":{"id":"doi:10.37236/535","is_oa":true,"landing_page_url":"https://doi.org/10.37236/535","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v18i1p48/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3491258566","display_name":"Probabilistic Considerations in the Analysis of Algorithms","funder_award_id":"0502793","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/W2951212467.pdf","grobid_xml":"https://content.openalex.org/works/W2951212467.grobid-xml"},"referenced_works_count":8,"referenced_works":["https://openalex.org/W1557925886","https://openalex.org/W1991965073","https://openalex.org/W2033652300","https://openalex.org/W2037114373","https://openalex.org/W2061468234","https://openalex.org/W2091476183","https://openalex.org/W2105714926","https://openalex.org/W2953220200"],"related_works":["https://openalex.org/W4287692100","https://openalex.org/W3188963412","https://openalex.org/W2297336610","https://openalex.org/W4296581269","https://openalex.org/W4372262496","https://openalex.org/W3022715693","https://openalex.org/W1979883786","https://openalex.org/W2084962005","https://openalex.org/W2104364550","https://openalex.org/W2029664913"],"abstract_inverted_index":{"In":[0],"the":[1],"random":[2],"$k$-uniform":[3],"hypergraph":[4],"$H_{n,p;k}$":[5],"of":[6,24,31],"order":[7,25],"$n$":[8,26,50],"each":[9],"possible":[10],"$k$-tuple":[11],"appears":[12],"independently":[13],"with":[14,49],"probability":[15],"$p$.":[16],"A":[17],"loose":[18,58],"Hamilton":[19,59],"cycle":[20,23],"is":[21,62],"a":[22,36,57],"in":[27,35],"which":[28],"every":[29],"pair":[30],"adjacent":[32],"edges":[33],"intersects":[34],"single":[37],"vertex.":[38],"We":[39],"prove":[40],"that":[41],"if":[42],"$p":[43],"n^{k-1}/\\log":[44],"n$":[45],"tends":[46],"to":[47],"infinity":[48],"then":[51],"$$\\lim_{\\substack{n\\to":[52],"\\infty\\\\":[53],"2(k-1)":[54],"|n}}\\Pr(H_{n,p;k}\\text{":[55],"contains":[56],"cycle})=1.$$":[60],"This":[61],"asymptotically":[63],"best":[64],"possible.":[65]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":5},{"year":2023,"cited_by_count":2},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":6},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}