{"id":"https://openalex.org/W3112182154","doi":"https://doi.org/10.37236/8414","title":"On the Minimum Size of Hamilton Saturated Hypergraphs","display_name":"On the Minimum Size of Hamilton Saturated Hypergraphs","publication_year":2020,"publication_date":"2020-11-27","ids":{"openalex":"https://openalex.org/W3112182154","doi":"https://doi.org/10.37236/8414","mag":"3112182154"},"language":"en","primary_location":{"id":"doi:10.37236/8414","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8414","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p36/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":"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://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p36/pdf","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"],"affiliations":[{"raw_affiliation_string":"Adam Mickiewicz University","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"],"affiliations":[{"raw_affiliation_string":"AGH University of Science and Technology","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":1.0907,"has_fulltext":true,"cited_by_count":2,"citation_normalized_percentile":{"value":0.76078558,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","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.982699990272522,"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.982699990272522,"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.9473999738693237,"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/T11151","display_name":"Advanced Topology and Set Theory","score":0.9417999982833862,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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.9392908811569214},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8780090808868408},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8448535203933716},{"id":"https://openalex.org/keywords/hamiltonian","display_name":"Hamiltonian (control theory)","score":0.6194987297058105},{"id":"https://openalex.org/keywords/hamiltonian-path","display_name":"Hamiltonian path","score":0.6138052344322205},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5723838806152344},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.284030944108963}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9392908811569214},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8780090808868408},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8448535203933716},{"id":"https://openalex.org/C130787639","wikidata":"https://www.wikidata.org/wiki/Q5645293","display_name":"Hamiltonian (control theory)","level":2,"score":0.6194987297058105},{"id":"https://openalex.org/C86524685","wikidata":"https://www.wikidata.org/wiki/Q273037","display_name":"Hamiltonian path","level":3,"score":0.6138052344322205},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5723838806152344},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.284030944108963},{"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/8414","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8414","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p36/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":"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/8414","is_oa":true,"landing_page_url":"https://doi.org/10.37236/8414","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v27i4p36/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":"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":[{"id":"https://openalex.org/F4320321040","display_name":"National Science Council","ror":"https://ror.org/02kv4zf79"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3112182154.pdf","grobid_xml":"https://content.openalex.org/works/W3112182154.grobid-xml"},"referenced_works_count":10,"referenced_works":["https://openalex.org/W1869302814","https://openalex.org/W1975405412","https://openalex.org/W1993865305","https://openalex.org/W1998516233","https://openalex.org/W2093497699","https://openalex.org/W2326337330","https://openalex.org/W2542613478","https://openalex.org/W4244050075","https://openalex.org/W6644014463","https://openalex.org/W6674083753"],"related_works":["https://openalex.org/W2963134840","https://openalex.org/W2600022275","https://openalex.org/W1970254348","https://openalex.org/W3015611351","https://openalex.org/W2963650557","https://openalex.org/W2083574881","https://openalex.org/W1969731303","https://openalex.org/W4300440759","https://openalex.org/W3101931093","https://openalex.org/W4308829499"],"abstract_inverted_index":{"For":[0],"$1\\leq":[1],"\\ell<":[2],"k$,":[3],"an":[4,46,74],"$\\ell$-overlapping":[5,47],"$k$-cycle":[6,49],"is":[7,38],"a":[8,63],"$k$-uniform":[9,35,77],"hypergraph":[10,36,52,78],"in":[11,73,91],"which,":[12],"for":[13,101,109],"some":[14],"cyclic":[15],"vertex":[16],"ordering,":[17],"every":[18,26,51],"edge":[19,59],"consists":[20],"of":[21,71,85],"$k$":[22],"consecutive":[23,28],"vertices":[24],"and":[25,88,104],"two":[27],"edges":[29,72],"share":[30],"exactly":[31],"$\\ell$":[32],"vertices.":[33,81],"A":[34],"$H$":[37,42,55],"$\\ell$-hamiltonian":[39,75],"saturated":[40,76],"if":[41],"does":[43,60],"not":[44],"contain":[45,61],"hamiltonian":[48],"but":[50],"obtained":[53],"from":[54],"by":[56],"adding":[57],"one":[58],"such":[62],"cycle.":[64],"Let":[65],"sat$(N,k,\\ell)$":[66],"be":[67],"the":[68,83],"smallest":[69],"number":[70],"on":[79],"$N$":[80],"In":[82],"case":[84],"graphs":[86],"Clark":[87],"Entringer":[89],"showed":[90],"1983":[92],"that":[93,100,118],"sat$(N,2,1)=\\lceil":[94],"\\tfrac{3N}2\\rceil$.":[95],"The":[96],"present":[97],"authors":[98],"proved":[99],"$k\\geq":[102],"3$":[103],"$\\ell=1$,":[105],"as":[106,108],"well":[107],"all":[110],"$0.8k\\leq":[111],"\\ell\\leq":[112],"k-1$,":[113],"sat$(N,k,\\ell)=\\Theta(N^{\\ell})$.":[114],"Here":[115],"we":[116],"prove":[117],"sat$(N,2\\ell,\\ell)=\\Theta\\left(N^\\ell\\right)$.":[119]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}