{"id":"https://openalex.org/W7118881935","doi":"https://doi.org/10.1137/1.9781611978971.87","title":"Perfect Matchings in Random Sparsifications of Dense Hypergraphs","display_name":"Perfect Matchings in Random Sparsifications of Dense Hypergraphs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7118881935","doi":"https://doi.org/10.1137/1.9781611978971.87"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611978971.87","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.87","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"type":"book-chapter","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/A5086267413","display_name":"Jie Han","orcid":"https://orcid.org/0000-0002-2013-2962"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Jie Han","raw_affiliation_strings":["Beijing Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology","institution_ids":["https://openalex.org/I125839683"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102824504","display_name":"Jingwen Zhao","orcid":"https://orcid.org/0000-0002-2263-654X"},"institutions":[{"id":"https://openalex.org/I125839683","display_name":"Beijing Institute of Technology","ror":"https://ror.org/01skt4w74","country_code":"CN","type":"education","lineage":["https://openalex.org/I125839683","https://openalex.org/I890469752"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingwen Zhao","raw_affiliation_strings":["Beijing Institute of Technology"],"affiliations":[{"raw_affiliation_string":"Beijing Institute of Technology","institution_ids":["https://openalex.org/I125839683"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5086267413"],"corresponding_institution_ids":["https://openalex.org/I125839683"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.27272727,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"2430","last_page":"2454"},"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.5559999942779541,"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.5559999942779541,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.2395000010728836,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.06310000270605087,"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.4652999937534332},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4260999858379364},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.3765999972820282},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.3714999854564667},{"id":"https://openalex.org/keywords/decision-problem","display_name":"Decision problem","score":0.35359999537467957},{"id":"https://openalex.org/keywords/perfect-power","display_name":"Perfect power","score":0.3271999955177307}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7566999793052673},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7468000054359436},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.48190000653266907},{"id":"https://openalex.org/C2781221856","wikidata":"https://www.wikidata.org/wiki/Q840247","display_name":"Hypergraph","level":2,"score":0.4652999937534332},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4260999858379364},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.3765999972820282},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.3714999854564667},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.35359999537467957},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.3271999955177307},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3172000050544739},{"id":"https://openalex.org/C136979486","wikidata":"https://www.wikidata.org/wiki/Q773483","display_name":"Existential quantification","level":2,"score":0.3093999922275543},{"id":"https://openalex.org/C47458327","wikidata":"https://www.wikidata.org/wiki/Q910404","display_name":"Random graph","level":3,"score":0.2987000048160553},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.2581000030040741}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611978971.87","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611978971.87","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2026 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","display_name":"Peace, Justice and strong institutions","score":0.7239492535591125}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"The":[0],"decision":[1,29,107],"problem":[2,30,132],"of":[3,40,64,71,91,117],"perfect":[4,65,118],"matchings":[5,66,119],"in":[6,43,67,120,133],"uniform":[7],"hypergraphs":[8,34],"is":[9,42,48,54,85],"famously":[10],"an":[11],"NP-complete":[12],"problem.":[13],"It":[14],"has":[15],"been":[16],"shown":[17],"by":[18],"Keevash\u2013Knox\u2013Mycroft":[19],"[STOC,":[20],"2013]":[21],"that":[22,37,75,101],"for":[23,77,129],"every":[24,38,83],"\\(\\varepsilon":[25],"\\gt":[26],"0\\),":[27],"such":[28,72,121],"restricted":[31],"to":[32],"\\(k\\)-uniform":[33,73],"\\(H\\)":[35],"satisfying":[36],"\\((k-1)\\)-set":[39],"vertices":[41],"at":[44],"least":[45],"\\((1/k+\\varepsilon)|H|\\)":[46],"edges":[47],"tractable,":[49],"and":[50],"the":[51,62,68,106,115,130],"quantity":[52],"\\(1/k\\)":[53],"best":[55],"possible.":[56],"In":[57],"this":[58],"paper":[59],"we":[60,96,109],"study":[61],"existence":[63],"random":[69],"\\(p\\)-sparsification":[70],"hypergraphs,":[74],"is,":[76],"\\(p":[78],"=":[79],"p(n)":[80],"\\in":[81],"[0,1]\\),":[82],"edge":[84],"kept":[86],"with":[87,102],"probability":[88,104],"\\(p\\)":[89],"independent":[90],"others.":[92],"As":[93],"a":[94,98],"consequence,":[95],"give":[97],"polynomial-time":[99],"algorithm":[100],"high":[103],"solves":[105],"problem;":[108],"also":[110],"derive":[111],"effective":[112],"bounds":[113],"on":[114],"number":[116],"hypergraphs.":[122],"At":[123],"last,":[124],"similar":[125],"results":[126],"are":[127],"obtained":[128],"\\(F\\)-factor":[131],"graphs.":[134]},"counts_by_year":[],"updated_date":"2026-01-08T20:10:11.968330","created_date":"2026-01-08T00:00:00"}