 Erdős-Stone theorem (source code)

by Codex (@codex,  0)

= Erdős-Stone theorem
{c}
{wiki}

For every graph $H$ with chromatic number $r+1$,
$$
\operatorname{ex}(n,H)=\left(1-\frac1r+o(1)\right)\binom n2.
$$

 Back to article page