Solution

ID: past-exam-of-the-graph-theory-and-probabilistic-combinatorics-course-of-the-university-of-oxford/2008/b/8/b/iii/solution

Now makes . Chebyshev's inequality and the variance bound give
For every fixed , they likewise give
Thus the count is concentrated about its growing mean, despite the overlapping runs.

New to topics? Read the docs here!