Iteration I Sample Clauses

Iteration I. We will start by constructing a partition Π(1). Therefore, we set t1 = [2/γ| and let be an arbitrary vertex partition. Furthermore, we set l1 = 1 and let the complete bipartite graphs Kij = ▇[▇▇, ▇▇], ▇ ≤ i < j ≤ t1, be their own pair-partition. Now, we define Π to be the above described family of parti- tions constructible in linear time. We have to check that Π(1) satisfies the conclusion of Theorem 4.1. Note that all but t [N/t1| N = 2t + O(N 2) 3 2