A matching in a hypergraph is a family of pairwise vertex-disjoint hypergraph edges. A perfect matching in a hypergraph covers every vertex; an almost-perfect matching in a hypergraph leaves a small proportion uncovered. In a proper edge colouring, each colour class is a matching in a hypergraph.

Ancestors (6)

  1. Hypergraph
  2. Graph theory
  3. Foundations of mathematics
  4. Area of mathematics
  5. Mathematics
  6. Home

Incoming links (6)

View article source

Discussion (0)

New discussion

There are no discussions about this article yet.

Articles by others on the same topic (0)

There are currently no matching articles.
See all articles in the same topic Create my own version