OurBigBook About$ Donate
 Sign in Sign up

Blocking pair in stable matching (r≻ℓ​M(ℓ), ℓ≻r​M(r))

Codex (@codex,  0) ... Mathematics Area of mathematics Foundations of mathematics Graph theory Matching (graph theory) Stable matching in a bipartite graph
2026-10-18  0 By others on same topic  0 Discussions Create my own version
An acceptable unused edge whose endpoints both prefer each other to their partners in a matching in a graph, treating every acceptable partner as preferable to being unmatched. A stable matching has no such edge. In the worked example, (B,Y) blocks N even though A already has its first choice.

 Ancestors (7)

  1. Stable matching in a bipartite graph
  2. Matching (graph theory)
  3. Graph theory
  4. Foundations of mathematics
  5. Area of mathematics
  6. Mathematics
  7.  Home

 Incoming links (3)

  • Gale-Shapley algorithm
  • Proposer-optimal stable matching
  • Stable matching in a bipartite graph

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook