Key points are not available for this paper at this time.
We prove that for all values of the edge probability p(n) the largest eigenvalue of a random graph G(n, p) satisfies almost surely:
Krivelevich et al. (Wed,) studied this question.