Math 2.0

Combinatorics Matchings and covers Concept

Matching

Summary

A matching in a graph is a set of edges without common ends. Matchings model pairing and assignment problems. The node matching gives the precise definition.

Further reading

  1. Web https://en.wikipedia.org/wiki/Matching_(graph_theory), Definitions
About this page
Tag0MJ04A50QW
URIm2://0MJ04A50QW
Kindconcept
WritingW1 stated
MSC05C70
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.

What links here

Special cases

Definitions