{"id":"https://openalex.org/W2542613478","doi":"https://doi.org/10.37236/5252","title":"Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs","display_name":"Upper Bounds on the Minimum Size of Hamilton Saturated Hypergraphs","publication_year":2016,"publication_date":"2016-10-28","ids":{"openalex":"https://openalex.org/W2542613478","doi":"https://doi.org/10.37236/5252","mag":"2542613478"},"language":"en","primary_location":{"id":"doi:10.37236/5252","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5252","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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://doi.org/10.37236/5252","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5078267731","display_name":"Andrzej Ruci\u0144ski","orcid":"https://orcid.org/0000-0002-0742-7694"},"institutions":[{"id":"https://openalex.org/I59411706","display_name":"Adam Mickiewicz University in Pozna\u0144","ror":"https://ror.org/04g6bbq64","country_code":"PL","type":"education","lineage":["https://openalex.org/I59411706"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Andrzej Ruci\u0144ski","raw_affiliation_strings":["Adam Mickiewicz University, Poznan, Poland"],"affiliations":[{"raw_affiliation_string":"Adam Mickiewicz University, Poznan, Poland","institution_ids":["https://openalex.org/I59411706"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5060839833","display_name":"Andrzej \u017bak","orcid":"https://orcid.org/0000-0002-3657-1417"},"institutions":[{"id":"https://openalex.org/I686019","display_name":"AGH University of Krakow","ror":"https://ror.org/00bas1c41","country_code":"PL","type":"education","lineage":["https://openalex.org/I686019"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Andrzej \u017bak","raw_affiliation_strings":["AGH University of Science and Technology, Krakow, Poland"],"affiliations":[{"raw_affiliation_string":"AGH University of Science and Technology, Krakow, Poland","institution_ids":["https://openalex.org/I686019"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5078267731"],"corresponding_institution_ids":["https://openalex.org/I59411706"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.17379345,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"23","issue":"4","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.9991999864578247,"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.9991999864578247,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9954000115394592,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9894999861717224,"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/hypergraph","display_name":"Hypergraph","score":0.8865270614624023},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8580546975135803},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7439984679222107},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.58675616979599},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.5406830310821533},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.4885915219783783},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.471926212310791},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.26493075489997864},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.09588319063186646}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8865270614624023},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8580546975135803},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7439984679222107},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.58675616979599},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.5406830310821533},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.4885915219783783},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.471926212310791},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.26493075489997864},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.09588319063186646},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.37236/5252","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5252","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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/5252","is_oa":true,"landing_page_url":"https://doi.org/10.37236/5252","pdf_url":null,"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":2,"referenced_works":["https://openalex.org/W1993865305","https://openalex.org/W2082894877"],"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/W2741440029","https://openalex.org/W2963911587"],"abstract_inverted_index":{"For":[0],"$1\\leqslant":[1],"\\ell<":[2],"k$,":[3],"an":[4,45,73,152],"$\\ell$-overlapping":[5,46],"$k$-cycle":[6,48],"is":[7,37],"a":[8,62],"$k$-uniform":[9,34,76],"hypergraph":[10,35,51,77],"in":[11,72,90,138],"which,":[12],"for":[13,100,108,141,157],"some":[14],"cyclic":[15],"vertex":[16],"ordering,":[17],"every":[18,26,50],"edge":[19,58],"consists":[20],"of":[21,70,84,127],"$k$":[22,159],"consecutive":[23,28],"vertices":[24],"and":[25,87,103,143,160],"two":[27,119],"edges":[29,71],"share":[30],"exactly":[31],"$\\ell$":[32],"vertices.A":[33],"$H$":[36,41,54],"$\\ell$-Hamiltonian":[38,74],"saturated":[39,75],"if":[40],"does":[42,59],"not":[43],"contain":[44,60],"Hamiltonian":[47],"but":[49],"obtained":[52],"from":[53],"by":[55],"adding":[56],"one":[57],"such":[61],"cycle.":[63],"Let":[64],"$\\mathrm{sat}(n,k,\\ell)$":[65],"be":[66],"the":[67,82,124,163],"smallest":[68,164],"number":[69],"on":[78],"$n$":[79],"vertices.":[80],"In":[81,114,162],"case":[83,166],"graphs":[85],"Clark":[86],"Entringer":[88],"showed":[89],"1983":[91],"that":[92,99,140],"$\\mathrm{sat}(n,2,1)=\\lceil":[93],"\\tfrac{3n}2\\rceil$.":[94],"The":[95,129],"present":[96],"authors":[97],"proved":[98],"$k\\geqslant":[101],"3$":[102],"$\\ell=1$,":[104],"as":[105,107],"well":[106],"all":[109,158],"$0.8k\\leqslant":[110],"\\ell\\leq":[111],"k-1$,":[112],"$\\mathrm{sat}(n,k,\\ell)=\\Theta(n^{\\ell})$.":[113],"this":[115],"paper":[116],"we":[117,145,167],"prove":[118],"upper":[120,153],"bounds":[121],"which":[122],"cover":[123],"remaining":[125],"range":[126],"$\\ell$.":[128,161],"first,":[130],"quite":[131],"technical":[132],"one,":[133],"restricted":[134],"to":[135,171],"$\\ell\\geqslant\\frac{k+1}2$,":[136],"implies":[137],"particular":[139],"$\\ell=\\tfrac23k$":[142],"$\\ell=\\tfrac34k$":[144],"have":[146],"$\\mathrm{sat}(n,k,\\ell)=O(n^{\\ell+1})$.":[147],"Our":[148],"main":[149],"result":[150],"provides":[151],"bound":[154],"$\\mathrm{sat}(n,k,\\ell)=O(n^{\\frac{k+\\ell}2})$":[155],"valid":[156],"open":[165],"improve":[168],"it":[169],"further":[170],"$\\mathrm{sat}(n,4,2)=O(n^{\\frac{14}5})$.":[172]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}