... of the Regularity Lemma, Journal of Algorithms 16 (1994) 80109 [2] A.Czygrinow and V.R¨dl, Algorithmic Regularity Lemma for Hypero graphs, in preparation [3] A.M.Frieze and R.Kannan, The Regularity ... ⊆ V is said to be − regular if for every X ⊆ A with |X| ≥ |A| and Y ⊆ B with |Y | ≥ |B|, we have |d(X, Y ) − d(A, B) | ≤ Theorem (Szemer´di’s Regularity Lemma) For every > and ine teger m > there ... )| We can combine Lemmas and to make an algorithm for finding an regular partition, much as in [1] Arbitrarily divide the vertices of G into an equitable partition P1 with classes V0 , V1 , ...