Perfect matching

ID: perfect-matching

Perfect matching by Wikipedia Bot 0
In graph theory, a **perfect matching** (or complete matching) is a specific type of matching in a graph. A matching is defined as a set of edges without common vertices. In the case of a perfect matching, each vertex of the graph is included in exactly one edge of the matching.

New to topics? Read the docs here!