Best Odds for Finding a Perfect Matching in a Bipartite Graph

DOI10.1017/S0963548306007577MaRDI QIDQ3412106zbMATH OpenFDO

Authors William Paulsen

Publication date 5 December 2006

Published in Combinatorics, Probability and Computing (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1017/S0963548306007577

Mathematics Subject Classification ID

Graphs and linear algebra (matrices, eigenvalues, etc.) (05C50) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

Recommendations

• Perfect matchings and derangements on graphs
• Existence of a perfect matching in a random (\(1+e^{-1}\))-out bipartite graph
• Learning a Hidden Matching
• Perfect matchings via uniform sampling in regular bipartite graphs
• Perfect matchings via uniform sampling in regular bipartite graphs

This page was built for publication: Best Odds for Finding a Perfect Matching in a Bipartite Graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3412106)