pith. sign in

arxiv: 2509.09831 · v1 · pith:PYTUO4B4new · submitted 2025-09-11 · 🧮 math.CO · cs.DM

On the edge expansion of random polytopes

classification 🧮 math.CO cs.DM
keywords polytoperandomedgeexpansiongraphfacesprobabilityvertices
0
0 comments X
read the original abstract

A $0/1$-polytope in $\mathbb{R}^n$ is the convex hull of a subset of $\{0,1\}^n$. The graph of a polytope $P$ is the graph whose vertices are the zero-dimensional faces of $P$ and whose edges are the one-dimensional faces of $P$. A conjecture of Mihail and Vazirani states that the edge expansion of the graph of every $0/1$-polytope is at least one. We study a random version of the problem, where the polytope is generated by selecting vertices of $\{0,1\}^n$ independently at random with probability $p\in (0,1)$. Improving earlier results, we show that, for any $p\in (0,1)$, with high probability the edge expansion of the random $0/1$-polytope is bounded from below by an absolute constant.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Random 0/1-polytopes expand rapidly

    math.CO 2026-04 unverdicted novelty 7.0

    Random 0/1-polytopes sampled with constant probability p have edge-expansion Θ(n) for p > 1/2 and n^Θ(log log n) for p < 1/2 with high probability.