{"id":"https://openalex.org/W1988229094","doi":"https://doi.org/10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","title":"New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help","display_name":"New bounds on nearly perfect matchings in hypergraphs: Higher codegrees do help","publication_year":2000,"publication_date":"2000-01-01","ids":{"openalex":"https://openalex.org/W1988229094","doi":"https://doi.org/10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","mag":"1988229094"},"language":"en","primary_location":{"id":"doi:10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5111926340","display_name":"Van H. Vu","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Van H. Vu","raw_affiliation_strings":["Microsoft Research, Redmond, WA 98052","Part of this work was done while the author was with the Institute for Advanced Study (Princeton, NJ) and was supported by a grant from NEC and the state of New Jersey"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA 98052","institution_ids":["https://openalex.org/I1290206253"]},{"raw_affiliation_string":"Part of this work was done while the author was with the Institute for Advanced Study (Princeton, NJ) and was supported by a grant from NEC and the state of New Jersey","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5111926340"],"corresponding_institution_ids":["https://openalex.org/I1290206253"],"apc_list":{"value":4330,"currency":"USD","value_usd":4330},"apc_paid":null,"fwci":4.6492,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.9518449,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":"17","issue":"1","first_page":"29","last_page":"63"},"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.9998999834060669,"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.9998999834060669,"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.9998000264167786,"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.9994999766349792,"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/combinatorics","display_name":"Combinatorics","score":0.7525006532669067},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.60834801197052},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3413166105747223}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7525006532669067},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.60834801197052},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3413166105747223}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","is_oa":false,"landing_page_url":"https://doi.org/10.1002/1098-2418(200008)17:1<29::aid-rsa4>3.0.co;2-w","pdf_url":null,"source":{"id":"https://openalex.org/S59667848","display_name":"Random Structures and Algorithms","issn_l":"1042-9832","issn":["1042-9832","1098-2418"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320595","host_organization_name":"Wiley","host_organization_lineage":["https://openalex.org/P4310320595"],"host_organization_lineage_names":["Wiley"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Random Structures and Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.121.8417","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.121.8417","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.rutgers.edu/~vanvu/papers/probmethod/nearmatch.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W170265681","https://openalex.org/W1594432720","https://openalex.org/W1971289435","https://openalex.org/W1973286131","https://openalex.org/W2024769658","https://openalex.org/W2036512668","https://openalex.org/W2042703645","https://openalex.org/W2045460927","https://openalex.org/W2059967030","https://openalex.org/W2068871408","https://openalex.org/W2079238469","https://openalex.org/W2088622619","https://openalex.org/W2090962863","https://openalex.org/W2108515073","https://openalex.org/W2155295958","https://openalex.org/W2518268960","https://openalex.org/W4249811006","https://openalex.org/W4312613502","https://openalex.org/W6604557676"],"related_works":["https://openalex.org/W1978042415","https://openalex.org/W1978225469","https://openalex.org/W2799759016","https://openalex.org/W3104631496","https://openalex.org/W2049729887","https://openalex.org/W2076027639","https://openalex.org/W2000144448","https://openalex.org/W1421410134","https://openalex.org/W1970195683","https://openalex.org/W3124101447"],"abstract_inverted_index":{"Let":[0],"H":[1],"be":[2,14],"a":[3,23,39,48,90,109],"(k+1)-uniform,":[4],"D-regular":[5],"hypergraph":[6],"on":[7,52,56,71],"n":[8],"vertices":[9,19,43],"and":[10,67,80,82,84,111],"let":[11],"\ud835\udcb0":[12,53],"(H)":[13],"the":[15,28,33,57,72,100,103],"minimum":[16],"number":[17,35],"of":[18,30,36,41,76,99,127],"left":[20],"uncovered":[21],"by":[22],"matching":[24],"in":[25,44,93],"H.":[26],"Cj(H),":[27],"j-codegree":[29],"H,":[31],"is":[32,102,108,126],"maximum":[34],"edges":[37],"sharing":[38],"set":[40],"j":[42],"common.":[45],"We":[46],"prove":[47,115],"general":[49],"upper":[50],"bound":[51,65],"(H),":[54,61],"based":[55],"codegree":[58],"sequence":[59],"C2":[60],"C3":[62],"(H),\u2026.":[63],"Our":[64],"improves":[66],"generalizes":[68],"many":[69],"results":[70,117],"topic,":[73],"including":[74],"those":[75],"Grable,":[77],"Alon,":[78],"Kim,":[79],"Spencer,":[81],"Kostochka":[83],"R\u00f6dl.":[85],"It":[86],"also":[87],"leads":[88],"to":[89,114],"substantial":[91],"improvement":[92],"several":[94],"applications.":[95],"The":[96],"key":[97],"ingredient":[98],"proof":[101],"so-called":[104],"polynomial":[105],"technique,":[106],"which":[107],"new":[110],"useful":[112],"tool":[113],"concentration":[116],"for":[118],"functions":[119],"with":[120],"large":[121],"Lipschitz":[122],"coefficient.":[123],"This":[124],"technique":[125],"independent":[128],"interest.":[129],"\u00a9":[130],"2000":[131,142],"John":[132],"Wiley":[133],"&":[134],"Sons,":[135],"Inc.":[136],"Random":[137],"Struct.":[138],"Alg.,":[139],"17:":[140],"29\u201363,":[141]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}