Linked from

The 13 pages that link to Maximum-cardinality matching, each with the reason it gives.

• Matching (graph theory)Broader topic: Maximum size is a common optimization goal for matchings.

• Bipartite matchingBroader topic: It is the principal optimization target, rather than merely any valid matching.

• Perfect matchingCompared with: A maximum matching need not cover every vertex, unlike a perfect matching.

• Stable marriage problemCompared with: Maximizing the number paired does not ensure that no pair prefers to deviate.

• Kidney 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.

• Dilworth's theoremBroader topic: A maximum matching in the comparability construction determines the minimum chain count.

• Hungarian algorithmCompared with: The Hungarian algorithm optimizes cost among perfect matchings, rather than cardinality alone.

• Kőnig's theoremBroader topic: Its size is the left-hand quantity in the theorem.

• Blossom algorithmRelated: The algorithm computes this optimum even when the graph is not bipartite.

• Edge coverBroader topic: Starting from one, add an incident edge for each still-uncovered vertex to obtain a minimum edge cover.

• Stable matching problemCompared with: Maximizing the number of pairs does not ensure that no blocking pair exists.

• Tutte's theorem on perfect matchingsRelated: The theorem's deficiency count characterizes how far a graph is from a perfect matching.