3 citations · 3 across the 4 of their papers we have counts for
4 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…