Uniform hypergraph

Uniform hypergraph --- униформный гиперграф, однородный гиперграф.

A hypergraph [math]\displaystyle{ {\mathcal H} }[/math] is a uniform hypergraph if [math]\displaystyle{ \min\{|e|; \; e \in {\mathcal E}\} = \max\{|e|: \; e \in {\mathcal E}\} }[/math] for all hyperedges [math]\displaystyle{ e \in {\mathcal E} }[/math].