Theorem 2.9 ([1]}) 
Given a graph \(R\)  of order \(r\)  and parameters \(\delta , \Delta \) , there exists \(\varepsilon = \varepsilon (\delta , \Delta , r)\)  such that the following holds. Suppose that one replaces the vertices of \(R\)  with sets of size \(n_1,\ldots ,n_r\)  and define a graph \(G_1\)  where each edge of \(R\)  is blown up to a \((\delta ,\varepsilon )\) -super-regular pair and a graph \(G_2\)  where each edge of \(R\)  is blown up to a complete graph. Then if a graph \(H\)  with maximum degree \(\Delta \)  embeds into \(G_2\)  it embeds into \(G_1\) .

