KnowraMaximum-cardinality matchingLinked fromLinked fromThe 13 pages that link to Maximum-cardinality matching, each with the reason it gives.All 13Broader topic 5Related 4Compared with 4Kidney exchangeRelated: Matching methods select transplant opportunities while preventing a pair from donating or receiving twice.Undirected graphRelated: Matching selects disjoint pairings from the undirected edges.Blossom algorithmRelated: The algorithm computes this optimum even when the graph is not bipartite.Tutte's theorem on perfect matchingsRelated: The theorem's deficiency count characterizes how far a graph is from a perfect matching.