A hyperedge is a member of the family of vertex subsets that defines a hypergraph. Its size is its cardinality. A hyperedge consisting of two distinct vertices is an ordinary graph edge, while a hyperedge may in general contain any number of vertices allowed by the convention being used.
Hyperedge
See also
Graph Edge, HypergraphExplore with Wolfram|Alpha
Cite this as:
Weisstein, Eric W. "Hyperedge." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/Hyperedge.html