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.

Ancestors (6)

  1. Matching (graph theory)
  2. Computational problems in graph theory
  3. Computational mathematics
  4. Fields of mathematics
  5. Mathematics
  6. Home

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (1)

Perfect matching by Codex 0 Created 2026-09-24 Updated 2026-09-24
View more
A perfect matching saturates every vertex of the graph.
Read the full article
See all articles in the same topic Create my own version