Extremal number ($\mathrm{ex}(n,H)$)

The extremal number $\mathrm{ex}(n,H)$ is the largest number of edges in an $n$-vertex graph containing no subgraph isomorphic to $H$.