{"id":"https://openalex.org/W2021058045","doi":"https://doi.org/10.1137/120865938","title":"On the Number of Perfect Matchings in a Bipartite Graph","display_name":"On the Number of Perfect Matchings in a Bipartite Graph","publication_year":2013,"publication_date":"2013-01-01","ids":{"openalex":"https://openalex.org/W2021058045","doi":"https://doi.org/10.1137/120865938","mag":"2021058045"},"language":"en","primary_location":{"id":"doi:10.1137/120865938","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120865938","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/A5060069256","display_name":"Marcelo H. de Carvalho","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Marcelo H. de Carvalho","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5064031252","display_name":"Cl\u00e1udio L. Lucchesi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cl\u00e1udio L. Lucchesi","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5030024556","display_name":"U. S. R. Murty","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"U. S. R. Murty","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5060069256"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3625,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.63007996,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":"27","issue":"2","first_page":"940","last_page":"958"},"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/T11329","display_name":"Limits and Structures in Graph Theory","score":0.9954000115394592,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9908000230789185,"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/combinatorics","display_name":"Combinatorics","score":0.9097716808319092},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.7959386110305786},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.7608320713043213},{"id":"https://openalex.org/keywords/perfect-graph-theorem","display_name":"Perfect graph theorem","score":0.6416460275650024},{"id":"https://openalex.org/keywords/perfect-power","display_name":"Perfect power","score":0.5635801553726196},{"id":"https://openalex.org/keywords/factor-critical-graph","display_name":"Factor-critical graph","score":0.5469071269035339},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.5392462611198425},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.5126511454582214},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.5028805136680603},{"id":"https://openalex.org/keywords/perfect-graph","display_name":"Perfect graph","score":0.46215444803237915},{"id":"https://openalex.org/keywords/crossing-number","display_name":"Crossing number (knot theory)","score":0.4408940076828003},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4232189357280731},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.4221935570240021},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4144085943698883},{"id":"https://openalex.org/keywords/graph-power","display_name":"Graph power","score":0.36789992451667786},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.30869901180267334},{"id":"https://openalex.org/keywords/voltage-graph","display_name":"Voltage graph","score":0.17149803042411804},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.08963635563850403}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.9097716808319092},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.7959386110305786},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.7608320713043213},{"id":"https://openalex.org/C161487630","wikidata":"https://www.wikidata.org/wiki/Q2800071","display_name":"Perfect graph theorem","level":5,"score":0.6416460275650024},{"id":"https://openalex.org/C93446932","wikidata":"https://www.wikidata.org/wiki/Q1972803","display_name":"Perfect power","level":2,"score":0.5635801553726196},{"id":"https://openalex.org/C36038622","wikidata":"https://www.wikidata.org/wiki/Q5428703","display_name":"Factor-critical graph","level":5,"score":0.5469071269035339},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.5392462611198425},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.5126511454582214},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.5028805136680603},{"id":"https://openalex.org/C32972407","wikidata":"https://www.wikidata.org/wiki/Q1187620","display_name":"Perfect graph","level":5,"score":0.46215444803237915},{"id":"https://openalex.org/C2777724877","wikidata":"https://www.wikidata.org/wiki/Q2548661","display_name":"Crossing number (knot theory)","level":3,"score":0.4408940076828003},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4232189357280731},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.4221935570240021},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4144085943698883},{"id":"https://openalex.org/C149530733","wikidata":"https://www.wikidata.org/wiki/Q5597091","display_name":"Graph power","level":4,"score":0.36789992451667786},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.30869901180267334},{"id":"https://openalex.org/C22149727","wikidata":"https://www.wikidata.org/wiki/Q7940747","display_name":"Voltage graph","level":4,"score":0.17149803042411804},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.08963635563850403},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"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":1,"locations":[{"id":"doi:10.1137/120865938","is_oa":false,"landing_page_url":"https://doi.org/10.1137/120865938","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1982321501","https://openalex.org/W1998621342","https://openalex.org/W2081357884","https://openalex.org/W2153548489","https://openalex.org/W2911804697","https://openalex.org/W4251499002","https://openalex.org/W4255431924"],"related_works":["https://openalex.org/W2132353434","https://openalex.org/W2356906936","https://openalex.org/W2105838663","https://openalex.org/W206883905","https://openalex.org/W2109934391","https://openalex.org/W3153161399","https://openalex.org/W3103428906","https://openalex.org/W2401632469","https://openalex.org/W2021058045","https://openalex.org/W2999485140"],"abstract_inverted_index":{"In":[0],"this":[1,30],"paper":[2],"we":[3,52],"show":[4,53],"that,":[5],"with":[6,17],"11":[7],"exceptions,":[8],"any":[9,55],"matching":[10],"covered":[11],"bipartite":[12],"graph":[13],"on":[14,49,57,68,87],"$n$":[15,58,69],"vertices,":[16],"minimum":[18],"degree":[19],"greater":[20],"than":[21],"two,":[22],"has":[23,60,71,91],"at":[24,61,92],"least":[25,62,93],"$2n-4$":[26],"perfect":[27,64,73,95],"matchings.":[28,65,74,96],"Using":[29],"bound,":[31],"which":[32],"is":[33],"the":[34],"best":[35],"possible,":[36],"and":[37],"McCuaig's":[38],"theorem":[39],"[W.":[40],"McCuaig,":[41],"J.":[42],"Graph":[43],"Theory,":[44],"38":[45],"(2001),":[46],"pp.":[47],"124--169]":[48],"brace":[50,56,86],"generation,":[51],"that":[54,77,84],"vertices":[59,70,90],"$(n-2)^2/8$":[63],"A":[66],"bi-wheel":[67],"$(n-2)^2/4$":[72,94],"We":[75],"conjecture":[76],"there":[78],"exists":[79],"an":[80],"integer":[81],"$N$":[82],"such":[83],"every":[85],"$n\\geq":[88],"N$":[89]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}