Combinatorics Matchings and covers Concept
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 gives the precise definition.
Where this leads
2 pages build on this one.
Further reading
- Web https://en.wikipedia.org/wiki/Perfect_matching, lead section
About this page
| Tag | 0NHK9MFFW9 |
|---|---|
| URI | m2://0NHK9MFFW9 |
| Kind | concept |
| Writing | W1 stated |
| MSC | 05C70 |
| Specializes | Matching |
| Same as |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: at least two examples (0 of 2)
- edge not_instance_of in: at least one non-example (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.