The Mihail-Vazirani conjecture and strong edge-expansion in random $0/1$ polytopes
Abstract: We study the edge-expansion of the graph of a random $0/1$ polytope $Pd_p$, defined as the convex hull of a random subset of the points in ${0,1}d$ where every point is retained independently and with probability $p$. This problem was introduced more than twenty years ago in a work of Gillmann and Kaibel, and has been extensively studied ever since. We prove that, for every fixed $\varepsilon>0$ and every $p\in(0,1-\varepsilon]$, with high probability the graph of $Pd_p$ has edge-expansion $Θ(d)$. This improves the previously best known bound due to Ferber, Krivelevich, Sales and Samotij, and verifies, in a strong form, the celebrated Mihail-Vazirani conjecture for random $0/1$ polytopes. Although the expansion factor $Θ(d)$ is typically best possible for $p\ge 1/2+\varepsilon$, we also show that the behaviour changes drastically at $p=1/2$. Namely, for every fixed $\varepsilon>0$ and every integer $k\ge 2$, if $p\le 1/2-\varepsilon$, then with high probability the graph of $Pd_p$ has edge-expansion $Ω(dk)$. Thus, random $0/1$ polytopes exhibit an interesting phase transition at $p=1/2$.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.