... triangles of G, and if A = {1, 2, 3}, say, then H∗(A) consists of all triangles in G with one vertex in each of X1, X2and X3, while H(A)consists of all 3-edges of H with one vertex in each of ... bounded number of pieces, almost all of which are quasiran-dom. This generalizes Szemer´edi’s regularity lemma for graphs (which formedpart of his proof of his theorem on arithmetic progressions).Given ... Ui= {x0i,x1i},and B consist of all sets of the form Bε= {xε11, ,xεkk}, with ε =(ε1, ,εk) ∈{0, 1}k. The set Ω was the set of all ways of choosing x0iand x1iin Xi,...