... : (there exists g ∈ L extending hi) & (g(vr) = v).That is to say, each vertex in Witogether with the vertices of hi(H) induces a copy ofH.Write d for the degree of vr in ... Hence, L covers G,completing the induction step and the proof of Theorem 3. ✷References[1] B. Bollob´as, Modern Graph Theory, Graduate Texts in Mathematics, 184, Springer-Verlag, New York (1998).[2] ... different injections.Hence, if G contains cnrinduced copies of H, we have a set M ⊂ H(G) with |M| ≥cnr. By Theorem 3, G contains an induced subgraph Y of type H(s, . . . s, t) with s =cr4−r2+rln...