The Turán number of sparse spanning graphs

Noga Alon, Raphael Yuster

For a graph $H$, the {\em extremal number} $ex(n,H)$ is the maximum number of edges in a graph of order $n$ not containing a subgraph isomorphic to $H$. Let $\delta (H)>0$ and $\Delta (H)$ den…