Supersaturation
= Supersaturation
Supersaturation strengthens an extremal existence theorem by forcing many copies of a forbidden graph when the edge count exceeds its extremal threshold by a fixed density. For a fixed clique, the <Erdős-Stone theorem> and averaging over bounded-size random vertex subsets give a positive multiple of $n^{|V(F)|}$ copies.