END USER LICENCE AGREEMENTDecember 28th, 2021
FiledDecember 28th, 2021Our proof strategy is based on verifying that the probability of a vertex being blue after T time-steps is o(1/n) , where T = O(log log n) , i.e. P(ξT (v) = B) = o(1/n) holds after T time-steps. This gives P(G is monochromatic red at step T ) =