3 citations · 3 across the 4 of their papers we have counts for
6 papers
The isoperimetric constant of the random graph process
Itai Benjamini, Simi Haber, Michael Krivelevich +1
The isoperimetric constant of a graph on vertices, , is the minimum of , taken over all nonempty subsets of size at most $n/…
Pseudo-random graphs
Michael Krivelevich, Benny Sudakov
Random graphs have proven to be one of the most important and fruitful concepts in modern Combinatorics and Theoretical Computer Science. Besides being a fascinating study subject…
On the asymptotic value of the choice number of complete multi-partite graphs
Nurit Gazit, Michael Krivelevich
We calculate the asymptotic value of the choice number of complete multi-partite graphs.
A Lower Bound on the Density of Sphere Packings via Graph Theory
Michael Krivelevich, Simon Litsyn, Alexander Vardy
Using graph-theoretic methods we give a new proof that for all sufficiently large , there exist sphere packings in of density at least , exceeding the classical…
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…
On the concentration of eigenvalues of random symmetric matrices
Michael Krivelevich, Van H. Vu
We prove that few largest (and most important) eigenvalues of random symmetric matrices of various kinds are very strongly concentrated. This strong concentration enables us to com…