Extremal hypergraph theory (source code)

= Extremal hypergraph theory

Extremal hypergraph theory studies the largest or smallest possible size of a <hypergraph> under prescribed forbidden-subhypergraph or covering conditions. It generalizes <extremal graph theory>. The <Turán density> describes the asymptotic maximum edge proportion for a fixed uniform forbidden hypergraph.