Rich set in a graph

A vertex set $R$ is $(s,k)$-rich when every $s$-element subset of $R$ has at least $k$ common neighbours.

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$.