All graphs considered in this paper are simple.
The Szemerédi Regularity lemma [1]} is one of the most powerful tools of graphThere are also
hypergraph versions that play crucial role in extremal hypergraph theory and combinatorial number theory, see eg., [2]} or [3]}. theory.
It is also used in many areas outside graph theory, for example
in number theory and algorithms.
