Uniform hypergraph ($|e|=r$)

A hypergraph is $r$-uniform if each hyperedge has exactly $r$ vertices. Ordinary simple graphs are 2-uniform hypergraphs. Its average hypergraph vertex degree is $r|E|/|V|$.

The complete $\ell$-uniform hypergraph on $r$ vertices contains every $\ell$-subset of its vertex set. A hypergraph clique here means a restriction to a vertex subset of this form, rather than merely a clique in the pairwise shadow. For $\ell =2$, it is an ordinary complete graph.

The complement of an $\ell$-uniform hypergraph on $V$ has all $\ell$-subsets of $V$ that are not hyperedges of the original hypergraph. An edge in every $r$-set of one hypergraph is equivalent to the absence of a complete $\ell$-uniform $r$-vertex hypergraph in its complement.