activity
20002005
most citedA Lower Bound on the Density of Sphere Packings via Graph Theory

3 citations · 3 across the 4 of their papers we have counts for

collaborators
Showing 2001Show all

1 paper · 1 filter

math.CO2001

THe largest eigenvalue of sparse random graphs

Michael Krivelevich, Benny Sudakov

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: λ_1(G)=(1+o(1))max{\sqrtΔ,np}, where Δis a maxima…