Matching
Definition
Let be a graph. A matching in is a set of edges of such that no two distinct edges of have a common end.
Remarks
A vertex is matched if it is an end of an edge of . Otherwise it is unmatched. A maximal matching is not contained in a larger matching. A maximum matching has the largest number of edges, the matching number . Every maximum matching is maximal, but the converse is false: in the path graph , the middle edge alone is a maximal matching.
Where this leads
6 pages build on this one.
Further reading
About this page
| Tag | 0Z87BHAFTB |
|---|---|
| URI | m2://0Z87BHAFTB |
| Kind | definition |
| Writing | W1 stated |
| MSC | 05C70 |
| Defines | Matching |
Markdown · JSON · Edit on GitHub
What this page needs for W2
- edge instance_of in: one example (0 of 1)
- edge not_instance_of in: one non-example that fails one clause (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.