{"id":"https://openalex.org/W2953093396","doi":"https://doi.org/10.1017/s0963548320000449","title":"Covering and tiling hypergraphs with tight cycles","display_name":"Covering and tiling hypergraphs with tight cycles","publication_year":2020,"publication_date":"2020-10-13","ids":{"openalex":"https://openalex.org/W2953093396","doi":"https://doi.org/10.1017/s0963548320000449","mag":"2953093396"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548320000449","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000449","pdf_url":null,"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":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/1701.08115","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Jie Han","orcid":null},"institutions":[{"id":"https://openalex.org/I17626003","display_name":"University of Rhode Island","ror":"https://ror.org/013ckk937","country_code":"US","type":"education","lineage":["https://openalex.org/I17626003"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jie Han","raw_affiliation_strings":["Department of Mathematics, University of Rhode Island, Kingston, RI 02881, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Mathematics, University of Rhode Island, Kingston, RI 02881, USA","institution_ids":["https://openalex.org/I17626003"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Allan Lo","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Allan Lo","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]},{"author_position":"last","author":{"id":null,"display_name":"Nicol\u00e1s Sanhueza-Matamala","orcid":null},"institutions":[{"id":"https://openalex.org/I79619799","display_name":"University of Birmingham","ror":"https://ror.org/03angcq70","country_code":"GB","type":"education","lineage":["https://openalex.org/I79619799"]}],"countries":["GB"],"is_corresponding":true,"raw_author_name":"Nicol\u00e1s Sanhueza-Matamala","raw_affiliation_strings":["School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Mathematics, University of Birmingham, Edgbaston, Birmingham, B15 2TT, UK","institution_ids":["https://openalex.org/I79619799"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I79619799"],"apc_list":null,"apc_paid":null,"fwci":2.1879,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.84605911,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"30","issue":"2","first_page":"288","last_page":"329"},"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.9296000003814697,"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.9296000003814697,"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.025299999862909317,"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.010099999606609344,"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.8991000056266785},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.558899998664856},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5583999752998352},{"id":"https://openalex.org/keywords/order","display_name":"Order (exchange)","score":0.444599986076355},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.41679999232292175}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.8991000056266785},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8481000065803528},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7867000102996826},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.558899998664856},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5583999752998352},{"id":"https://openalex.org/C182306322","wikidata":"https://www.wikidata.org/wiki/Q1779371","display_name":"Order (exchange)","level":2,"score":0.444599986076355},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4302000105381012},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.41679999232292175},{"id":"https://openalex.org/C181789720","wikidata":"https://www.wikidata.org/wiki/Q4812191","display_name":"Asymptotically optimal algorithm","level":2,"score":0.28610000014305115},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.27489998936653137}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548320000449","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548320000449","pdf_url":null,"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:1701.08115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.08115","pdf_url":"https://arxiv.org/pdf/1701.08115","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":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:openaire_cris_publications/62f93ed3-ff89-4e88-be94-862b8727bcb7","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/62f93ed3-ff89-4e88-be94-862b8727bcb7","pdf_url":null,"source":{"id":"https://openalex.org/S4306402634","display_name":"University of Birmingham Research Portal (University of Birmingham)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I79619799","host_organization_name":"University of Birmingham","host_organization_lineage":["https://openalex.org/I79619799"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Han, J, Lo, A & Sanhueza-Matamala, N 2020, 'Covering and tiling hypergraphs with tight cycles', Combinatorics, Probability and Computing, vol. 0, pp. 1-36. https://doi.org/10.1017/S0963548320000449","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:1701.08115","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1701.08115","pdf_url":"https://arxiv.org/pdf/1701.08115","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":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8514069245","display_name":null,"funder_award_id":"EP/P002420/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W130475654","https://openalex.org/W1867281446","https://openalex.org/W1923478559","https://openalex.org/W1966080659","https://openalex.org/W1971539651","https://openalex.org/W1994422705","https://openalex.org/W2022230023","https://openalex.org/W2030651378","https://openalex.org/W2032076435","https://openalex.org/W2171957589","https://openalex.org/W2478722229","https://openalex.org/W2963988718","https://openalex.org/W4232826661"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"A":[1],"k":[2,13,22,34,43,50,54,71,105,130,132,182,186,193,199,213,215,227,256,261],"-uniform":[3,72,133,183,216,228],"tight":[4,124],"cycle":[5],"$C_s^k$":[6,96,196,247],"is":[7,38,58,69,90,100,109,153,181,197,252,257,265],"a":[8,16,70,93,123,128,147,154,172,209,245],"hypergraph":[9,73,229],"on":[10],"s":[11,36,45,56,107,189,239,263],">":[12],"vertices":[14,24],"with":[15,74,231],"cyclic":[17],"ordering":[18,27],"such":[19],"that":[20,62],"every":[21,88,226],"consecutive":[23],"under":[25],"this":[26],"form":[28],"an":[29,204],"edge.":[30],"The":[31,98],"pair":[32],"(":[33,42,53,84,104,260],",":[35,44,55,106,146,167,194,225,262],")":[37,46,57,108,240,264],"admissible":[39],"if":[40,63,103,255],"gcd":[41,52],"=":[47],"1":[48],"or":[49],"/":[51],"even.":[59],"We":[60],"prove":[61,203],"$s":[64,222],"\\ge":[65,165,223],"2{k^2}$":[66],"and":[67,144,259],"H":[68,85,145,152,230],"minimum":[75,232],"codegree":[76,233],"at":[77,234],"least":[78,235],"(1/2":[79,236],"+":[80,237,241],"o":[81,242],"(1))|":[82],"V":[83],")|,":[86],"then":[87,195],"vertex":[89],"covered":[91],"by":[92],"copy":[94],"of":[95,138,157,160,174,211],".":[97,162,219],"bound":[99,251],"asymptotically":[101,253],"sharp":[102,254],"admissible.":[110,266],"Our":[111],"main":[112],"tool":[113],"allows":[114],"us":[115],"to":[116],"arbitrarily":[117],"rearrange":[118],"the":[119,250],"order":[120],"in":[121,151],"which":[122,135],"path":[125],"wraps":[126],"around":[127],"complete":[129],"-partite":[131,214],"hypergraph,":[134],"may":[136],"be":[137],"independent":[139],"interest.":[140],"For":[141,163],"hypergraphs":[142,217],"F":[143,149,161,176,180,205,218],"perfect":[148,246],"-tiling":[150,177,206],"spanning":[155],"collection":[156],"vertex-disjoint":[158],"copies":[159],"$k":[164],"3$":[166],"there":[168],"are":[169],"currently":[170],"only":[171],"handful":[173],"known":[175],"results":[178],"when":[179],"but":[184],"not":[185,198],"-partite.":[187,200],"If":[188],"\u2262":[190],"0":[191],"mod":[192],"Here":[201],"we":[202],"result":[207],"for":[208,221],"family":[210],"non-":[212],"Namely,":[220],"5{k^2}$":[224],"1/(2":[238],"(1))|V(H)|":[243],"has":[244],"-tiling.":[248],"Moreover,":[249],"even":[258]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-06-27T00:00:00"}