Hypergraph

graph-theory

Definition

Hypergraph

A hypergraph is a generalisation of a graph where an edge, in this context called a hyperedge, can connect any number of vertices.

Formally, a hypergraph $H$ is defined as a pair $H=(V,E)$, where:

• $V=\{v_1,\dots ,v_n\}$ is a finite set of elements called vertices or nodes.
• $E=\{e_1,e_2,\dots ,e_m\}$ is a family of subsets of $V$, where each subset $e_i\subseteq V$ is a hyperedge.

¹

Footnotes

1. Hypergraph - Wikipedia ↩