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

2 papers · 2 filters

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 $n$ , there exist sphere packings in $R^{n}$ of density at least $c n 2^{- n}$ , exceeding the classical…