A hypergraph consists of a vertex set and a family of subsets of , called hyperedges. Unlike a graph, a hyperedge may contain more than two vertices. A uniform hypergraph restricts all hyperedges to one fixed size.
A hypergraph is a generalization of a graph in which an edge can connect any number of vertices, rather than just two. In a traditional graph, an edge is a connection between exactly two vertices. In contrast, a hypergraph allows an edge (often called a hyperedge) to link multiple vertices simultaneously.
New to topics? Read the docs here!