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 math.COShow all

3 papers · 1 filter

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…

math.CO2004

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.

math.CO2004★ 3 cited

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…