Matching in a hypergraph
= Matching in a hypergraph
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>.