The largest eigenvalue of sparse random graphs

We prove that, for all values of the edge probability p(n), the largest eigenvalue of the random graph G(n, p) satisfies almost surely lambda(1) (G) = (1 + o(1)) max{rootDelta, np}, where Delta is the maximum degree of G, and the o(1) term tends to zero as max{rootDelta, np} tends to infinity.