---
tag: RVXNPCV258
kind: statement
role: theorem
name: Supersaturation Theorem
sources:
  - wikipedia: en:21682838@r1343710334
    locator: Forbidden subgraph problem, section Supersaturation > Supersaturation Theorem
    note: adopted
    mention: wikipedia://en/21682838#TV17
    sections: [Statement]
inventory: [3B8647Y1CM]
---

## Statement

Consider an $h$-uniform hypergraph $H$ with $v(H)$ vertices. The supersaturation theorem states that for every $\epsilon > 0$, there exists a $\delta > 0$ such that if $G$ is an $h$-uniform hypergraph on $n$ vertices and at least $(\pi(H) + \epsilon) \binom{n}{h}$ edges for $n$ sufficiently large, then there are at least $\delta n^{v(H)}$ copies of $H$. 

Equivalently, we can restate this theorem as the following: If a graph $G$ with $n$ vertices has $o(n^{v(H)})$ copies of $H$, then there are at most $\pi(H) \binom{n}{2} + o(n^2)$ edges in $G$.