The critical random graph, with martingales

We give a short proof that the largest component of the random graph $G(n, 1/n)$isofsizeapproximately$n^{2/3}$. The proof gives explicit bounds for the probability that the ratio is very large or very small.