On the edge expansion of random polytopes
Combinatorics
2025-09-15 v1 Discrete Mathematics
Abstract
A -polytope in is the convex hull of a subset of . The graph of a polytope is the graph whose vertices are the zero-dimensional faces of and whose edges are the one-dimensional faces of . A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every -polytope is at least one. We study a random version of the problem, where the polytope is generated by selecting vertices of independently at random with probability . Improving earlier results, we show that, for any , with high probability the edge expansion of the random -polytope is bounded from below by an absolute constant.
Keywords
Cite
@article{arxiv.2509.09831,
title = {On the edge expansion of random polytopes},
author = {Asaf Ferber and Michael Krivelevich and Marcelo Sales and Wojciech Samotij},
journal= {arXiv preprint arXiv:2509.09831},
year = {2025}
}
Comments
16 pages, 4 figures