Corrigendum: The cover time of the giant component of a random graph, Random Structures and Algorithms 32 (2008), 401–439

The above paper gives an asymptotically precise estimate of the cover time of the giant component of a sparse random graph. The proof as it stands is not tight enough, and in particular, Eq. (64) is not strong enough to prove (65). The o(1) term in (64) needs to be improved to o(1/(lnn)2) for (65) to follow. The following section, which replaces Section 3.6, amends this oversight. The notation and definitions are from the paper.