{"id":"https://openalex.org/W2164770202","doi":"https://doi.org/10.1145/2213977.2214074","title":"Nearly complete graphs decomposable into large induced matchings and their applications","display_name":"Nearly complete graphs decomposable into large induced matchings and their applications","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2164770202","doi":"https://doi.org/10.1145/2213977.2214074","mag":"2164770202"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214074","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel Aviv University and Institute for Advanced Study, Tel Aviv, Israel"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University and Institute for Advanced Study, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045798295","display_name":"Ankur Moitra","orcid":"https://orcid.org/0000-0001-7047-0495"},"institutions":[{"id":"https://openalex.org/I40036882","display_name":"Institute for Advanced Study","ror":"https://ror.org/00f809463","country_code":"US","type":"facility","lineage":["https://openalex.org/I40036882"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ankur Moitra","raw_affiliation_strings":["Institute for Advanced Study, Princeton, USA"],"affiliations":[{"raw_affiliation_string":"Institute for Advanced Study, Princeton, USA","institution_ids":["https://openalex.org/I40036882"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066741544","display_name":"Benny Sudakov","orcid":"https://orcid.org/0000-0003-3307-9475"},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Benny Sudakov","raw_affiliation_strings":["University of California, Los Angeles, Los Angeles, USA"],"affiliations":[{"raw_affiliation_string":"University of California, Los Angeles, Los Angeles, USA","institution_ids":["https://openalex.org/I161318765"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5083469386"],"corresponding_institution_ids":["https://openalex.org/I16391192"],"apc_list":null,"apc_paid":null,"fwci":1.6848,"has_fulltext":false,"cited_by_count":43,"citation_normalized_percentile":{"value":0.85209538,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"1079","last_page":"1090"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9998999834060669,"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.9998999834060669,"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7972981333732605},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.597728967666626},{"id":"https://openalex.org/keywords/disjoint-sets","display_name":"Disjoint sets","score":0.5622154474258423},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5403213500976562},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5326041579246521},{"id":"https://openalex.org/keywords/disjoint-union","display_name":"Disjoint union (topology)","score":0.5245140790939331},{"id":"https://openalex.org/keywords/pairwise-comparison","display_name":"Pairwise comparison","score":0.4888297915458679},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.45849549770355225},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.45663005113601685},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4342584013938904},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.43350130319595337},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.41346073150634766},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.29161208868026733},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2584877610206604},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.23791280388832092}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7972981333732605},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.597728967666626},{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.5622154474258423},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5403213500976562},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5326041579246521},{"id":"https://openalex.org/C7655956","wikidata":"https://www.wikidata.org/wiki/Q5282259","display_name":"Disjoint union (topology)","level":2,"score":0.5245140790939331},{"id":"https://openalex.org/C184898388","wikidata":"https://www.wikidata.org/wiki/Q1435712","display_name":"Pairwise comparison","level":2,"score":0.4888297915458679},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.45849549770355225},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.45663005113601685},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4342584013938904},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.43350130319595337},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.41346073150634766},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.29161208868026733},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2584877610206604},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.23791280388832092},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2213977.2214074","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214074","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5600000023841858,"display_name":"Sustainable cities and communities","id":"https://metadata.un.org/sdg/11"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W1990571240","https://openalex.org/W1994700616","https://openalex.org/W2009976792","https://openalex.org/W2023600080","https://openalex.org/W2038521541","https://openalex.org/W2046549378","https://openalex.org/W2054996571","https://openalex.org/W2086670230","https://openalex.org/W2087964954","https://openalex.org/W2090798615","https://openalex.org/W2091921997","https://openalex.org/W2093276208","https://openalex.org/W2096590808","https://openalex.org/W2101806532","https://openalex.org/W2116537669","https://openalex.org/W2142677297","https://openalex.org/W2143569998","https://openalex.org/W2144475416","https://openalex.org/W2161620758","https://openalex.org/W2164542539","https://openalex.org/W2610052675","https://openalex.org/W3004537778","https://openalex.org/W3030488835","https://openalex.org/W3100139723"],"related_works":["https://openalex.org/W2058834578","https://openalex.org/W55187247","https://openalex.org/W1891636518","https://openalex.org/W2073363580","https://openalex.org/W264408731","https://openalex.org/W411819533","https://openalex.org/W2067430117","https://openalex.org/W4247056703","https://openalex.org/W1972516737","https://openalex.org/W2315249199"],"abstract_inverted_index":{"We":[0],"describe":[1],"two":[2,56],"constructions":[3,118],"of":[4,13,38,47,50,64,80,86,102,106,110,123],"(very)":[5],"dense":[6],"graphs":[7,21],"which":[8,28],"are":[9],"edge":[10,61],"disjoint":[11,34,62],"unions":[12],"large":[14],"induced":[15,35,68],"matchings.":[16],"The":[17,41],"first":[18],"construction":[19,43],"exhibits":[20],"on":[22,91],"N":[23],"vertices":[24],"with":[25],"(N2)-o(N2)":[26],"edges,":[27],"can":[29],"be":[30],"decomposed":[31],"into":[32],"pairwise":[33],"matchings,":[36,69],"each":[37,58],"size":[39],"N1-o(1).":[40],"second":[42],"provides":[44],"a":[45,75,78,84,94,120,126],"covering":[46],"all":[48],"edges":[49],"the":[51,60,100,107,131],"complete":[52],"graph":[53,108],"KN":[54],"by":[55],"graphs,":[57],"being":[59],"union":[63],"at":[65],"most":[66],"N2-\u03b4":[67],"where":[70],"\u03b4>0.076.":[71],"This":[72],"disproves":[73],"(in":[74],"strong":[76],"form)":[77],"conjecture":[79],"Meshulam,":[81],"substantially":[82],"improves":[83],"result":[85],"Birk,":[87],"Linial":[88],"and":[89,97,104,112],"Meshulam":[90],"communicating":[92],"over":[93],"shared":[95],"channel,":[96],"(slightly)":[98],"extends":[99],"analysis":[101],"Hastad":[103],"Wigderson":[105],"test":[109],"Samorodnitsky":[111],"Trevisan":[113],"for":[114,130],"linearity.":[115],"Additionally,":[116],"our":[117],"settle":[119],"combinatorial":[121],"question":[122],"Vempala":[124],"regarding":[125],"candidate":[127],"rounding":[128],"scheme":[129],"directed":[132],"Steiner":[133],"tree":[134],"problem.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":4},{"year":2020,"cited_by_count":7},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":3},{"year":2017,"cited_by_count":11},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}