Use this tag for questions about hypergraphs, i.e. generalizations of graphs in graph theory, in which edges are allowed to be arbitrary subsets of vertices, instead of just pairs.
Hypergraphs are a generalization of graphs in which an edge can join any number of vertices, instead of just two.
Formally, a hypergraph consists of:
- a set of vertices;
- a family of sets of vertices, called hyperedges or just edges.
We often consider $k$-uniform hypergraphs for some value of $k$: in these, all hyperedges contain exactly $k$ vertices. Thus, graphs are exactly the $2$-uniform hypergraphs.
One standard references for this area is Berge's Graphs and Hypergraphs.
