noun. A generalization of a graph, in which edges can connect any number of vertices.

"However, Cutkosky was able to provide an alternate method of detecting primes for a hypergraph in any dimension, relying on different structures than those used in the two-dimensional theorem."