The critical random graph, with martingales

Asaf Nachmias, Yuval Peres

We give a short proof that the largest component of the random graph $G(n,1/n)$ is of size approximately $n^{2/3}$. The proof gives explicit bounds for the probability that the ra…