--- title: "Alan M. Frieze" chunk: 2/2 source: "https://en.wikipedia.org/wiki/Alan_M._Frieze" category: "reference" tags: "science, encyclopedia" date_saved: "2026-05-05T17:17:20.488241+00:00" instance: "kb-cron" --- (b) If σ 1 ( W ) ≥ γ p q {\displaystyle \sigma _{1}(W)\geq \gamma {\sqrt {pq}}} , then there exist S ⊆ R {\displaystyle S\subseteq R} , T ⊆ C {\displaystyle T\subseteq C} such that | S | ≥ γ ′ p {\displaystyle |S|\geq \gamma 'p} , | T | ≥ γ ′ q {\displaystyle |T|\geq \gamma 'q} and W ( S , T ) ≥ γ ′ | S | | T | {\displaystyle W(S,T)\geq \gamma '|S||T|} where γ ′ = γ 3 / 108 {\displaystyle \gamma '=\gamma ^{3}/108} . Furthermore, S {\displaystyle S} , T {\displaystyle T} can be constructed in polynomial time. These two lemmas are combined in the following algorithmic construction of the Szemerédi regularity lemma. [Step 1] Arbitrarily divide the vertices of G {\displaystyle G} into an equitable partition P 1 {\displaystyle P_{1}} with classes V 0 , V 1 , … , V b {\displaystyle V_{0},V_{1},\ldots ,V_{b}} where | V i | ⌊ n / b ⌋ {\displaystyle |V_{i}|\lfloor n/b\rfloor } and hence | V 0 | < b {\displaystyle |V_{0}|