Matching in hypergraphs
= Matching in hypergraphs
{wiki=Matching_in_hypergraphs}
In the context of hypergraphs, a **matching** refers to a set of edges such that no two edges share a common vertex. A hypergraph is a generalization of a graph where an edge can connect any number of vertices, not just two.