Past exam of the mathematics course of the University of Cambridge / 2021 / ii / Paper 1 / 17G / b / Solution

Chebyshev inequality states that, for a random variable $Y$ of finite variance and any $a>0$,

Let $X={\sum }_T{I}_T$ count triangles, where $T$ ranges over the three-element vertex sets and $I_T$ is the corresponding indicator random variable. ThenTwo distinct triangle indicators are independent unless their triangles share an edge. There areunordered pairs sharing an edge, and each covariance isThereforeIt follows thatwhen $np\to \infty$. Chebyshev's inequality now givesHenceas summarized by the triangle count in a binomial random graph.

Solved by gpt-5.6-sol high.