Best Odds for Finding a Perfect Matching in a Bipartite Graph

W. Paulsen. Best Odds for Finding a Perfect Matching in a Bipartite Graph. Combinatorics, Probability & Computing, 15(5):753-763, 2006. [doi]

@article{Paulsen06,
  title = {Best Odds for Finding a Perfect Matching in a Bipartite Graph},
  author = {W. Paulsen},
  year = {2006},
  doi = {10.1017/S0963548306007577},
  url = {http://dx.doi.org/10.1017/S0963548306007577},
  tags = {graph-rewriting, rewriting},
  researchr = {https://researchr.org/publication/Paulsen06},
  cites = {0},
  citedby = {0},
  journal = {Combinatorics, Probability & Computing},
  volume = {15},
  number = {5},
  pages = {753-763},
}