---
tag: 0NHK9MFFW9
kind: concept
name: Perfect matching
msc: [05C70]
sources:
  - url: https://en.wikipedia.org/wiki/Perfect_matching
    locator: lead section
same_as:
  wikidata: Q99567093
  wikipedia: Perfect matching
---

## Summary

A perfect matching is a matching that covers every vertex of a graph. The theorems of Hall and Tutte say when a graph has one. The node [[perfect matching|05ZPH8KF9K]] gives the precise definition.