{"id":"https://openalex.org/W1500336836","doi":"https://doi.org/10.37236/3594","title":"Extensions to 2-Factors in Bipartite Graphs","display_name":"Extensions to 2-Factors in Bipartite Graphs","publication_year":2013,"publication_date":"2013-08-02","ids":{"openalex":"https://openalex.org/W1500336836","doi":"https://doi.org/10.37236/3594","mag":"1500336836"},"language":"en","primary_location":{"id":"doi:10.37236/3594","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3594","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i3p11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"type":"article","indexed_in":["crossref","doaj"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i3p11/pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5067445399","display_name":"Jennifer Vandenbussche","orcid":null},"institutions":[{"id":"https://openalex.org/I206426949","display_name":"Southern Polytechnic State University","ror":"https://ror.org/00cckeg37","country_code":"US","type":"education","lineage":["https://openalex.org/I206426949"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jennifer Vandenbussche","raw_affiliation_strings":["Southern Polytechnic State University, Marietta, GA, USA","Southern Polytechnic State University Marietta GA USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Southern Polytechnic State University, Marietta, GA, USA","institution_ids":["https://openalex.org/I206426949"]},{"raw_affiliation_string":"Southern Polytechnic State University Marietta GA USA","institution_ids":["https://openalex.org/I206426949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5017595199","display_name":"Douglas B. West","orcid":"https://orcid.org/0000-0001-8818-1667"},"institutions":[{"id":"https://openalex.org/I135237710","display_name":"Zhejiang Normal University","ror":"https://ror.org/01vevwk45","country_code":"CN","type":"education","lineage":["https://openalex.org/I135237710"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Douglas B. West","raw_affiliation_strings":["Zhejiang Normal University, Jinhua, China, and University of Illinois, Urbana, IL, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Zhejiang Normal University, Jinhua, China, and University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I135237710"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":10,"citation_normalized_percentile":{"value":0.03503673,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"20","issue":"3","first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/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/T11797","display_name":"graph theory and CDMA systems","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.8947566747665405},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.8533835411071777},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.8311234712600708},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.5751977562904358},{"id":"https://openalex.org/keywords/hypercube","display_name":"Hypercube","score":0.5525717735290527},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5332068800926208},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5262750387191772},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5115481615066528},{"id":"https://openalex.org/keywords/cograph","display_name":"Cograph","score":0.4927232563495636},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.48564422130584717},{"id":"https://openalex.org/keywords/edge-transitive-graph","display_name":"Edge-transitive graph","score":0.4799090325832367},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.46358275413513184},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.4390372037887573},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.43497639894485474},{"id":"https://openalex.org/keywords/1-planar-graph","display_name":"1-planar graph","score":0.39283329248428345},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3713850975036621},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.22628232836723328}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.8947566747665405},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.8533835411071777},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.8311234712600708},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.5751977562904358},{"id":"https://openalex.org/C50820777","wikidata":"https://www.wikidata.org/wiki/Q213723","display_name":"Hypercube","level":2,"score":0.5525717735290527},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5332068800926208},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5262750387191772},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5115481615066528},{"id":"https://openalex.org/C59824394","wikidata":"https://www.wikidata.org/wiki/Q5141281","display_name":"Cograph","level":5,"score":0.4927232563495636},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.48564422130584717},{"id":"https://openalex.org/C200597783","wikidata":"https://www.wikidata.org/wiki/Q4391289","display_name":"Edge-transitive graph","level":5,"score":0.4799090325832367},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.46358275413513184},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.4390372037887573},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.43497639894485474},{"id":"https://openalex.org/C102192266","wikidata":"https://www.wikidata.org/wiki/Q4545823","display_name":"1-planar graph","level":4,"score":0.39283329248428345},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3713850975036621},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.22628232836723328},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"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.37236/3594","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3594","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i3p11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.299.3596","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.299.3596","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.uiuc.edu/~west/pubs/s2fac.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.370.5776","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.370.5776","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.combinatorics.org/ojs/index.php/eljc/article/viewFile/v20i3p11/pdf/","raw_type":"text"}],"best_oa_location":{"id":"doi:10.37236/3594","is_oa":true,"landing_page_url":"https://doi.org/10.37236/3594","pdf_url":"https://www.combinatorics.org/ojs/index.php/eljc/article/download/v20i3p11/pdf","source":{"id":"https://openalex.org/S38448739","display_name":"The Electronic Journal of Combinatorics","issn_l":"1077-8926","issn":["1077-8926","1097-1440"],"is_oa":true,"is_in_doaj":true,"is_core":true,"host_organization":"https://openalex.org/P4310317970","host_organization_name":"Electronic Journal of Combinatorics","host_organization_lineage":["https://openalex.org/P4310317970"],"host_organization_lineage_names":["Electronic Journal of Combinatorics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The Electronic Journal of Combinatorics","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G280301322","display_name":null,"funder_award_id":"H98230-10-1-0363","funder_id":"https://openalex.org/F4320311089","funder_display_name":"National Security Agency"},{"id":"https://openalex.org/G7845798442","display_name":null,"funder_award_id":"H98230","funder_id":"https://openalex.org/F4320311089","funder_display_name":"National Security Agency"}],"funders":[{"id":"https://openalex.org/F4320311089","display_name":"National Security Agency","ror":"https://ror.org/0047bvr32"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W1500336836.pdf","grobid_xml":"https://content.openalex.org/works/W1500336836.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W100457624","https://openalex.org/W433784926","https://openalex.org/W1591580148","https://openalex.org/W1964119857","https://openalex.org/W1980811831","https://openalex.org/W1984841803","https://openalex.org/W1998536346","https://openalex.org/W2011977293","https://openalex.org/W2018140157","https://openalex.org/W2026407613","https://openalex.org/W2027861912","https://openalex.org/W2027979690","https://openalex.org/W2042847307","https://openalex.org/W2064284095","https://openalex.org/W2068462604","https://openalex.org/W2071072049","https://openalex.org/W2085970062","https://openalex.org/W2088131503","https://openalex.org/W2226362667","https://openalex.org/W2783178894","https://openalex.org/W3192960030","https://openalex.org/W6629533851","https://openalex.org/W6634519006","https://openalex.org/W6726571729"],"related_works":["https://openalex.org/W4213457879","https://openalex.org/W4280539597","https://openalex.org/W4322494918","https://openalex.org/W4254020973","https://openalex.org/W3029390739","https://openalex.org/W4287773996","https://openalex.org/W1954384522","https://openalex.org/W2515819996","https://openalex.org/W2062824568","https://openalex.org/W1500336836"],"abstract_inverted_index":{"A":[0],"graph":[1,78],"is":[2,8],"$d$-bounded":[3],"if":[4],"its":[5],"maximum":[6],"degree":[7],"at":[9],"most":[10],"$d$.":[11],"We":[12],"apply":[13],"the":[14,26,47],"Ore-Ryser":[15],"Theorem":[16],"on":[17],"$f$-factors":[18],"in":[19,35,46,61,73],"bipartite":[20,37,64,77],"graphs":[21],"to":[22,32,51,68,80,85,96],"obtain":[23,56],"conditions":[24,57],"for":[25,58],"extension":[27],"of":[28],"a":[29,33,36,52,74,81],"$2$-bounded":[30],"subgraph":[31],"$2$-factor":[34],"graph.":[38],"As":[39],"consequences,":[40],"we":[41,55],"prove":[42],"that":[43,70,87],"every":[44,71],"matching":[45,72],"$5$-dimensional":[48],"hypercube":[49],"extends":[50,79],"$2$-factor,":[53,82],"and":[54],"this":[59],"property":[60],"general":[62],"regular":[63,75],"graphs.":[65],"For":[66],"example,":[67],"show":[69,86],"$n$-vertex":[76],"it":[83],"suffices":[84],"all":[88],"matchings":[89],"with":[90],"fewer":[91],"than":[92],"$n/3$":[93],"edges":[94],"extend":[95],"$2$-factors.":[97]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}