A graph whose hyperedges connect two or more vertices. Formal Definition: A hypergraph G can be defined as a pair (V, E), where V is a set of vertices, and E is a set of hyperedges between the vertices. Each hyperedge is a set of vertices: E ⊆ ((u, v, ...) ∈ 2^V). (Hyperedges are undirected.)