Reduced hypergraph

Reduced hypergraph --- сокращенный гиперграф.

A hypergraph [math]\displaystyle{ {\mathcal H} }[/math] is a reduced hypergraph if no edge [math]\displaystyle{ e \in {\mathcal H} }[/math] is contained in its another edge.