{"id":"https://openalex.org/W1977278487","doi":"https://doi.org/10.1017/s0963548306007577","title":"Best Odds for Finding a Perfect Matching in a Bipartite Graph","display_name":"Best Odds for Finding a Perfect Matching in a Bipartite Graph","publication_year":2006,"publication_date":"2006-07-31","ids":{"openalex":"https://openalex.org/W1977278487","doi":"https://doi.org/10.1017/s0963548306007577","mag":"1977278487"},"language":"en","primary_location":{"id":"doi:10.1017/s0963548306007577","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007577","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","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/A5079743727","display_name":"William Paulsen","orcid":"https://orcid.org/0000-0002-9588-136X"},"institutions":[{"id":"https://openalex.org/I125956826","display_name":"Arkansas State University","ror":"https://ror.org/006pyvd89","country_code":"US","type":"education","lineage":["https://openalex.org/I125956826"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"W. PAULSEN","raw_affiliation_strings":["Department of Mathematics and Statistics, Arkansas State University, PO Box 70, State University, AR 72432, USA (e-mail:","Department of Mathematics and Statistics, Arkansas State University, PO Box 70, State University, AR 72432, USA (e-mail: wpaulsen@math.astate.edu)"],"affiliations":[{"raw_affiliation_string":"Department of Mathematics and Statistics, Arkansas State University, PO Box 70, State University, AR 72432, USA (e-mail:","institution_ids":["https://openalex.org/I125956826"]},{"raw_affiliation_string":"Department of Mathematics and Statistics, Arkansas State University, PO Box 70, State University, AR 72432, USA (e-mail: wpaulsen@math.astate.edu)","institution_ids":["https://openalex.org/I125956826"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5079743727"],"corresponding_institution_ids":["https://openalex.org/I125956826"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07904085,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"15","issue":"5","first_page":"753","last_page":"763"},"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.9998000264167786,"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.9998000264167786,"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/T11797","display_name":"graph theory and CDMA systems","score":0.9994999766349792,"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"}},{"id":"https://openalex.org/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9979000091552734,"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/bipartite-graph","display_name":"Bipartite graph","score":0.908811092376709},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.691655158996582},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6888387203216553},{"id":"https://openalex.org/keywords/odds","display_name":"Odds","score":0.6762533783912659},{"id":"https://openalex.org/keywords/3-dimensional-matching","display_name":"3-dimensional matching","score":0.6385656595230103},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5042015314102173},{"id":"https://openalex.org/keywords/complete-bipartite-graph","display_name":"Complete bipartite graph","score":0.49543845653533936},{"id":"https://openalex.org/keywords/permutation","display_name":"Permutation (music)","score":0.4854174554347992},{"id":"https://openalex.org/keywords/strong-perfect-graph-theorem","display_name":"Strong perfect graph theorem","score":0.45618146657943726},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4160270094871521},{"id":"https://openalex.org/keywords/line-graph","display_name":"Line graph","score":0.36900150775909424},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.34963274002075195},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.3275092840194702},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.08132350444793701},{"id":"https://openalex.org/keywords/pathwidth","display_name":"Pathwidth","score":0.06320109963417053},{"id":"https://openalex.org/keywords/philosophy","display_name":"Philosophy","score":0.04940152168273926}],"concepts":[{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.908811092376709},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.691655158996582},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6888387203216553},{"id":"https://openalex.org/C143095724","wikidata":"https://www.wikidata.org/wiki/Q515895","display_name":"Odds","level":3,"score":0.6762533783912659},{"id":"https://openalex.org/C72545166","wikidata":"https://www.wikidata.org/wiki/Q10866593","display_name":"3-dimensional matching","level":4,"score":0.6385656595230103},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5042015314102173},{"id":"https://openalex.org/C134119311","wikidata":"https://www.wikidata.org/wiki/Q913598","display_name":"Complete bipartite graph","level":4,"score":0.49543845653533936},{"id":"https://openalex.org/C21308566","wikidata":"https://www.wikidata.org/wiki/Q7169365","display_name":"Permutation (music)","level":2,"score":0.4854174554347992},{"id":"https://openalex.org/C51044901","wikidata":"https://www.wikidata.org/wiki/Q16680059","display_name":"Strong perfect graph theorem","level":5,"score":0.45618146657943726},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4160270094871521},{"id":"https://openalex.org/C203776342","wikidata":"https://www.wikidata.org/wiki/Q1378376","display_name":"Line graph","level":3,"score":0.36900150775909424},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.34963274002075195},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3275092840194702},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.08132350444793701},{"id":"https://openalex.org/C43517604","wikidata":"https://www.wikidata.org/wiki/Q7144893","display_name":"Pathwidth","level":4,"score":0.06320109963417053},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.04940152168273926},{"id":"https://openalex.org/C151956035","wikidata":"https://www.wikidata.org/wiki/Q1132755","display_name":"Logistic regression","level":2,"score":0.0},{"id":"https://openalex.org/C107038049","wikidata":"https://www.wikidata.org/wiki/Q35986","display_name":"Aesthetics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1017/s0963548306007577","is_oa":false,"landing_page_url":"https://doi.org/10.1017/s0963548306007577","pdf_url":null,"source":{"id":"https://openalex.org/S7291079","display_name":"Combinatorics Probability Computing","issn_l":"0963-5483","issn":["0963-5483","1469-2163"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310311721","host_organization_name":"Cambridge University Press","host_organization_lineage":["https://openalex.org/P4310311721","https://openalex.org/P4310311702"],"host_organization_lineage_names":["Cambridge University Press","University of Cambridge"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Combinatorics, Probability and Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/10","display_name":"Reduced inequalities","score":0.6000000238418579}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W247697463","https://openalex.org/W1524298768","https://openalex.org/W2137550253"],"related_works":["https://openalex.org/W2352066879","https://openalex.org/W2371352078","https://openalex.org/W2184969544","https://openalex.org/W2154392321","https://openalex.org/W4232683556","https://openalex.org/W2561454982","https://openalex.org/W2025260311","https://openalex.org/W2147115438","https://openalex.org/W2033371793","https://openalex.org/W2058511514"],"abstract_inverted_index":{"We":[0,38],"will":[1,39],"study":[2],"the":[3,24,27,34,42,46,50,59],"best":[4],"way":[5],"to":[6,73],"reveal":[7],"a":[8,13,55,66,75,83],"hidden":[9],"perfect":[10,36,51,63],"matching":[11,52],"in":[12,23,61],"balanced":[14],"bipartite":[15,68],"graph":[16],"by":[17,21],"eliminating":[18],"edges,":[19],"one":[20],"one,":[22],"hope":[25],"that":[26,44,62],"eliminated":[28],"edge":[29],"is":[30,71],"not":[31],"part":[32],"of":[33,48,58,86],"mystery":[35,76],"matching.":[37,64],"look":[40],"for":[41],"strategy":[43],"maximizes":[45],"odds":[47],"finding":[49,74],"without":[53],"revealing":[54],"fixed":[56,84],"number":[57,85],"edges":[60],"For":[65],"complete":[67],"graph,":[69],"this":[70],"equivalent":[72],"permutation":[77],"via":[78],"negative":[79,88],"guesses":[80],"with":[81],"only":[82],"incorrect":[87],"guesses.":[89]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}