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 4Matching (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.Dilworth's theoremBroader topic: A maximum matching in the comparability construction determines the minimum chain count.Kőnig's theoremBroader topic: Its size is the left-hand quantity in the theorem.Edge coverBroader topic: Starting from one, add an incident edge for each still-uncovered vertex to obtain a minimum edge cover.