In an independent random two-colouring of , a given -vertex set is monochromatic with probability . Events on sets intersecting in at most one vertex use disjoint edges. Thus dependency degree is at most . The Lovász local lemma gives a colouring avoiding all monochromatic when . For the expression is , by Stirling's approximation. Taking tending sufficiently slowly to proves .

Articles by others on the same topic (0)

There are currently no matching articles.