Michael Krivelevich

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 2005Show all

2 papers · 1 filter

math.PR2005

The isoperimetric constant of the random graph process

Itai Benjamini, Simi Haber, Michael Krivelevich +1

The isoperimetric constant of a graph $G$ on $n$ vertices, $i (G)$ , is the minimum of $\frac{∣ \partial S ∣}{∣ S ∣}$ , taken over all nonempty subsets $S \subset V (G)$ of size at most $n/…

math.CO2005

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…