Rich-set embedding lemma

If a bipartite graph $H$ has $k$ vertices and maximum degree at most $d$, then every graph containing a $(d,k)$-rich set of at least $k$ vertices contains a copy of $H$.