KnowraPerfect matchingLinked fromLinked fromThe 12 pages that link to Perfect matching, each with the reason it gives.All 12Broader topic 5Related 4Narrower topic 2Compared with 1Matching (graph theory)Broader topic: This special matching pairs every vertex, rather than leaving some unmatched.Bipartite matchingBroader topic: It is a stronger requirement than simply having no shared endpoints.Stable marriage problemRelated: The classical balanced problem seeks a stable pairing that matches everyone.Hungarian algorithmNarrower topic: The algorithm's goal is a matching that assigns every item and recipient.Blossom algorithmBroader topic: A perfect matching exists precisely when a maximum matching covers all vertices.Matching polynomialRelated: Chemical applications often focused on counting complete bond pairings.Maximum-cardinality matchingBroader topic: It is a maximum-cardinality matching when it exists, but requires covering all vertices.Edge coverCompared with: It is an edge cover with the additional requirement that selected edges be disjoint.Stable roommates problemRelated: Pairing everyone requires a perfect matching, but stability imposes an additional condition.Baranyai's theoremRelated: A 1-factor is the hypergraph counterpart of a perfect matching.FKT algorithmBroader topic: These are the objects whose total number the algorithm computes.Tutte's theorem on perfect matchingsNarrower topic: The theorem characterizes exactly when a graph has this spanning set of edges.