Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/iii/paper-122/4/c/solution

For fixed disjoint , the random variable has the binomial distribution . A two-sided Chernoff bound gives
When , this is at most
There are at most ordered disjoint pairs , since each vertex can lie in , in , or in neither. The union bound therefore makes the probability of any failure at most
which proves the simultaneous estimate.

New to topics? Read the docs here!