Consider a graph H∈H(n,Δ), for some Δ≥2 and n sufficiently large. Using the property of high-girth Ramanujan graphs (Lemma 3.3), we show that there exists an induced embedding of H in Γ=Γ(Δ,n). Moreover, we give a deterministic strategy how to find …