{"id":"https://openalex.org/W2963274279","doi":"https://doi.org/10.1017/s0963548317000268","title":"Exact Minimum Codegree Threshold for <i>K</i><sup>\u2212</sup><sub>4</sub>-Factors","display_name":"Exact Minimum Codegree Threshold for <i>K</i><sup>\u2212</sup><sub>4</sub>-Factors","publication_year":2017,"publication_date":"2017-08-04","ids":{"openalex":"https://openalex.org/W2963274279","doi":"https://doi.org/10.1017/s0963548317000268","mag":"2963274279"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548317000268","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000268","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B9ECF83CA9AF217848B7579842445CD5/S0963548317000268a.pdf/div-class-title-exact-minimum-codegree-threshold-for-span-class-italic-k-span-span-class-sup-span-span-class-sub-4-span-factors-div.pdf","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":["crossref"],"open_access":{"is_oa":true,"oa_status":"bronze","oa_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B9ECF83CA9AF217848B7579842445CD5/S0963548317000268a.pdf/div-class-title-exact-minimum-codegree-threshold-for-span-class-italic-k-span-span-class-sup-span-span-class-sub-4-span-factors-div.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5086267413","display_name":"Jie Han","orcid":"https://orcid.org/0000-0002-2013-2962"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"JIE HAN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022659483","display_name":"Allan Lo","orcid":"https://orcid.org/0000-0001-9767-2863"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ALLAN LO","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086607043","display_name":"Andrew Treglown","orcid":"https://orcid.org/0000-0002-4293-5678"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"ANDREW TREGLOWN","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5006385137","display_name":"Yi Zhao","orcid":"https://orcid.org/0000-0002-1152-1229"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"YI ZHAO","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.4381,"has_fulltext":true,"cited_by_count":14,"citation_normalized_percentile":{"value":0.96845426,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"26","issue":"6","first_page":"856","last_page":"885"},"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/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"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9718000292778015,"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.9481204152107239},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8726953268051147},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7068581581115723},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.6771867871284485},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.6608107089996338},{"id":"https://openalex.org/keywords/cover","display_name":"Cover (algebra)","score":0.6084815859794617},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5361255407333374},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5118746161460876},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4097774922847748},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.13767671585083008}],"concepts":[{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.9481204152107239},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8726953268051147},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7068581581115723},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.6771867871284485},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.6608107089996338},{"id":"https://openalex.org/C2780428219","wikidata":"https://www.wikidata.org/wiki/Q16952335","display_name":"Cover (algebra)","level":2,"score":0.6084815859794617},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5361255407333374},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5118746161460876},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4097774922847748},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.13767671585083008},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1017/s0963548317000268","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000268","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B9ECF83CA9AF217848B7579842445CD5/S0963548317000268a.pdf/div-class-title-exact-minimum-codegree-threshold-for-span-class-italic-k-span-span-class-sup-span-span-class-sub-4-span-factors-div.pdf","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:pure.atira.dk:openaire_cris_publications/221369fc-326f-4268-9611-088891137b7a","is_oa":true,"landing_page_url":"https://research.birmingham.ac.uk/en/publications/221369fc-326f-4268-9611-088891137b7a","pdf_url":"https://pure-oai.bham.ac.uk/ws/files/41369239/k4_factorRev1a.pdf","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":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Han, J, Lo, A, Treglown, A & Zhao, Y 2017, 'Exact minimum codegree threshold for K - 4 -factors', Combinatorics, Probability and Computing, vol. 26, pp. 856-885. https://doi.org/10.1017/S0963548317000268","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:pure.atira.dk:publications/221369fc-326f-4268-9611-088891137b7a","is_oa":true,"landing_page_url":"https://www.cambridge.org/core/journals/combinatorics-probability-and-computing/article/exact-minimum-codegree-threshold-for-k-4factors/B9ECF83CA9AF217848B7579842445CD5","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, Treglown, A & Zhao, Y 2017, 'Exact minimum codegree threshold for K - 4 -factors', Combinatorics, Probability and Computing, vol. 26, pp. 856-885. https://doi.org/10.1017/S0963548317000268","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"doi:10.1017/s0963548317000268","is_oa":true,"landing_page_url":"https://doi.org/10.1017/s0963548317000268","pdf_url":"https://www.cambridge.org/core/services/aop-cambridge-core/content/view/B9ECF83CA9AF217848B7579842445CD5/S0963548317000268a.pdf/div-class-title-exact-minimum-codegree-threshold-for-span-class-italic-k-span-span-class-sup-span-span-class-sub-4-span-factors-div.pdf","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"},"sustainable_development_goals":[{"score":0.4699999988079071,"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions"}],"awards":[{"id":"https://openalex.org/G3572101131","display_name":null,"funder_award_id":"2014/","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G3916157125","display_name":null,"funder_award_id":"EP/M016641/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G4127730535","display_name":null,"funder_award_id":"2014/18641-5","funder_id":"https://openalex.org/F4320320997","funder_display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo"},{"id":"https://openalex.org/G6832725401","display_name":"Independence in groups, graphs and the integers","funder_award_id":"EP/M016641/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"},{"id":"https://openalex.org/G7855462740","display_name":null,"funder_award_id":"DMS-1400073","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"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/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309636","display_name":"University of Minnesota","ror":"https://ror.org/03grvy078"},{"id":"https://openalex.org/F4320320997","display_name":"Funda\u00e7\u00e3o de Amparo \u00e0 Pesquisa do Estado de S\u00e3o Paulo","ror":"https://ror.org/02ddkpn78"},{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2963274279.pdf","grobid_xml":"https://content.openalex.org/works/W2963274279.grobid-xml"},"referenced_works_count":23,"referenced_works":["https://openalex.org/W603387139","https://openalex.org/W830927343","https://openalex.org/W1492438130","https://openalex.org/W1505016730","https://openalex.org/W1763958263","https://openalex.org/W1923478559","https://openalex.org/W1957375148","https://openalex.org/W1978453013","https://openalex.org/W2005146019","https://openalex.org/W2014564484","https://openalex.org/W2053158631","https://openalex.org/W2099989374","https://openalex.org/W2110354774","https://openalex.org/W2115730400","https://openalex.org/W2144292514","https://openalex.org/W2168244850","https://openalex.org/W2170527238","https://openalex.org/W2171957589","https://openalex.org/W2183769808","https://openalex.org/W2496833595","https://openalex.org/W2763148572","https://openalex.org/W2963988718","https://openalex.org/W2963991599"],"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/W2472555608","https://openalex.org/W4376608938","https://openalex.org/W4288275998","https://openalex.org/W4214498971"],"abstract_inverted_index":{"Given":[0],"hypergraphs":[1],"F":[2,7,18],"and":[3,38,86,117],"H":[4,10,25,53],",":[5],"an":[6,95],"-factor":[8],"in":[9,24,124],"is":[11,77],"a":[12,65,82,113],"set":[13],"of":[14,17,84,99,106,115],"vertex-disjoint":[15],"copies":[16],"which":[19],"cover":[20],"all":[21],"the":[22,32,73,107],"vertices":[23,37,56],".":[26],"Let":[27],"K":[28,66],"\u2212":[29,67],"4":[30,68],"denote":[31],"3-uniform":[33,51],"hypergraph":[34,52],"with":[35,57],"four":[36],"three":[39],"edges.":[40],"We":[41],"show":[42],"that":[43],"for":[44,89],"sufficiently":[45],"large":[46,90],"n":[47,55,62],"\u2208":[48],"4\u2115,":[49],"every":[50],"on":[54,72],"minimum":[58,74],"codegree":[59,75],"at":[60],"least":[61],"/2\u22121":[63],"contains":[64],"-factor.":[69],"Our":[70,102],"bound":[71],"here":[76],"best":[78],"possible.":[79],"It":[80],"resolves":[81],"conjecture":[83],"Lo":[85],"Markstr\u00f6m":[87],"[15]":[88],"hypergraphs,":[91],"who":[92],"earlier":[93],"proved":[94],"asymptotically":[96],"exact":[97],"version":[98],"this":[100],"result.":[101],"proof":[103],"makes":[104],"use":[105],"absorbing":[108],"method":[109],"as":[110,112],"well":[111],"result":[114],"Keevash":[116],"Mycroft":[118],"[11]":[119],"concerning":[120],"almost":[121],"perfect":[122],"matchings":[123],"hypergraphs.":[125]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":3},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2019-07-30T00:00:00"}