The main advantage of Theorem REF  is that, as the above example shows, it can be applied for graphs
having “real-life” size, or for relatively sparse graphs, unlike the Szemerédi Regularity lemma.
Therefore, it may extend the scope when usual methods for graph embedding (eg. counting lemma or the Blow-up lemma [1]}) can be applied.
