The regularity lemma provides us with structural information for all but an eps-fraction of the vertices. In order to prove statements for spanning graphs one needs a stronger version: the so-called blowup lemma by Komlos, Sarkozy, and Szemeredi provides this. We introduce the lemma and some of its striking consequences.
Copyright. All Rights Reserved.