Hostname: page-component-8448b6f56d-m8qmq Total loading time: 0 Render date: 2024-04-23T19:11:40.316Z Has data issue: false hasContentIssue false
  • English
  • Français

Best Odds for Finding a Perfect Matching in a Bipartite Graph

Published online by Cambridge University Press:  31 July 2006

W. PAULSEN
W. PAULSEN
Affiliation:
Department of Mathematics and Statistics, Arkansas State University, PO Box 70, State University, AR 72432, USA (e-mail: wpaulsen@math.astate.edu)
Get access Rights & Permissions [Opens in a new window]

Abstract

We will study the best way to reveal a hidden perfect matching in a balanced bipartite graph by eliminating edges, one by one, in the hope that the eliminated edge is not part of the mystery perfect matching. We will look for the strategy that maximizes the odds of finding the perfect matching without revealing a fixed number of the edges in that perfect matching. For a complete bipartite graph, this is equivalent to finding a mystery permutation via negative guesses with only a fixed number of incorrect negative guesses.

Type
Paper
Information
Combinatorics, Probability and Computing , Volume 15 , Issue 5 , September 2006 , pp. 753 - 763
Copyright
2006 Cambridge University Press

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)