{"id":"https://openalex.org/W2026407613","doi":"https://doi.org/10.1137/080732687","title":"Matching Extendability in Hypercubes","display_name":"Matching Extendability in Hypercubes","publication_year":2009,"publication_date":"2009-01-01","ids":{"openalex":"https://openalex.org/W2026407613","doi":"https://doi.org/10.1137/080732687","mag":"2026407613"},"language":"en","primary_location":{"id":"doi:10.1137/080732687","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732687","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","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/A5067445399","display_name":"Jennifer Vandenbussche","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jennifer Vandenbussche","raw_affiliation_strings":["jvandenb@spsu.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"jvandenb@spsu.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":["west@math.uiuc.edu#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"west@math.uiuc.edu#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3562,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.6283373,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"23","issue":"3","first_page":"1539","last_page":"1547"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9997000098228455,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.9993000030517578,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":0.9901999831199646,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/hypercube","display_name":"Hypercube","score":0.9246827960014343},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8714030981063843},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8556188344955444},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8062918186187744},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.7716609239578247},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.712438702583313},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.5169098377227783},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.44788050651550293},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.4160316288471222},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.05330997705459595},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.0449332594871521}],"concepts":[{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.9246827960014343},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8714030981063843},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8556188344955444},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8062918186187744},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.7716609239578247},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.712438702583313},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.5169098377227783},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.44788050651550293},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.4160316288471222},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.05330997705459595},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0449332594871521},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/080732687","is_oa":false,"landing_page_url":"https://doi.org/10.1137/080732687","pdf_url":null,"source":{"id":"https://openalex.org/S117679221","display_name":"SIAM Journal on Discrete Mathematics","issn_l":"0895-4801","issn":["0895-4801","1095-7146"],"is_oa":false,"is_in_doaj":false,"is_core":true,"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":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Discrete Mathematics","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.44999998807907104,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":9,"referenced_works":["https://openalex.org/W1984841803","https://openalex.org/W2013278241","https://openalex.org/W2023171457","https://openalex.org/W2063292248","https://openalex.org/W2063889627","https://openalex.org/W2165941143","https://openalex.org/W3048245657","https://openalex.org/W4239440221","https://openalex.org/W4239906122"],"related_works":["https://openalex.org/W3087772622","https://openalex.org/W2567825307","https://openalex.org/W4295762832","https://openalex.org/W1592682627","https://openalex.org/W2785998768","https://openalex.org/W2945016732","https://openalex.org/W2371352078","https://openalex.org/W2362975861","https://openalex.org/W2054458431","https://openalex.org/W2013252038"],"abstract_inverted_index":{"In":[0],"a":[1,5,56,101],"bipartite":[2],"graph":[3],"G,":[4],"set":[6,18,27],"$S\\subseteq":[7],"V(G)$":[8],"is":[9,20],"deficient":[10,26],"if":[11,22],"$|N(S)|<|S|$.":[12],"A":[13],"matching":[14,48,96],"M":[15],"(with":[16],"vertex":[17,86],"U)":[19],"k-suitable":[21,47],"$G-U$":[23],"has":[24],"no":[25],"of":[28,62,83,85],"size":[29],"less":[30],"than":[31],"k.":[32],"Let":[33],"$f_k(d)$":[34],"be":[35],"the":[36,42,81],"largest":[37],"r":[38,52],"such":[39],"that":[40,68,93],"in":[41,88,97],"d-dimensional":[43],"hypercube":[44],"$Q_d$":[45,98],"every":[46,94],"with":[49],"at":[50],"most":[51],"edges":[53],"extends":[54,99],"to":[55,100],"perfect":[57,102],"matching.":[58,103],"We":[59,90],"generalize":[60],"results":[61],"Limaye":[63],"and":[64],"Sarvate":[65],"by":[66],"proving":[67],"$f_k(d)=k(d-k)+\\binom{k-1}{2}$":[69],"for":[70],"$k\\leq":[71],"d-3$.":[72],"To":[73],"this":[74],"end":[75],"we":[76],"prove":[77,92],"lower":[78],"bounds":[79],"on":[80],"sizes":[82],"neighborhoods":[84],"sets":[87],"$Q_d$.":[89],"also":[91],"induced":[95]},"counts_by_year":[{"year":2026,"cited_by_count":5},{"year":2025,"cited_by_count":2},{"year":2020,"cited_by_count":2},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}