@article{Komls1997BlowUpL,
title={Blow-Up Lemma},
author={J{\'a}nos Koml{\'o}s and G{\'a}bor N. S{\'a}rk{\"o}zy and Endre Szemer{\'e}di},
journal={Combinatorica},
year={1997},
volume={17},
pages={109-123}
}

The Regularity Lemma [16] is a powerful tool in Graph Theory and its applications. It basically says that every graph can be well approximated by the union of a constant number of random-looking bipartite graphs called regular pairs (see the definitions below). These bipartite graphs share many local properties with random bipartite graphs, e.g. most degrees are about the same, most pairs of vertices have about as many common neighbours as is expected in a random graph, and so on. These… CONTINUE READING