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.Blossom algorithmBroader topic: A perfect matching exists precisely when a maximum matching covers all vertices.Maximum-cardinality matchingBroader topic: It is a maximum-cardinality matching when it exists, but requires covering all vertices.FKT algorithmBroader topic: These are the objects whose total number the algorithm computes.