 Graph embedding lemma for regular pairs

For every finite graph $H$ and density $\delta >0$, sufficiently large vertex classes joined according to $H$ by regular pairs of density at least $\delta$ contain a copy of $H$. The regularity parameter must be sufficiently small in terms of $H$ and $\delta$.