pith. sign in

Random 0/1-polytopes expand rapidly

1 Pith paper cite this work. Polarity classification is still indexing.

1 Pith paper citing it
abstract

A 0/1-polytope is the convex hull of a subset $V\subseteq \{0,1\}^n$. A celebrated conjecture of Mihail and Vazirani asserts that the graph of every 0/1-polytope has edge-expansion at least 1. In this paper, we show that typical 0/1-polytopes have significantly stronger expansion. Specifically, if $V$ is formed by sampling each vertex of $\{0,1\}^n$ independently with constant probability $p$, then with high probability the edge-expansion is $\Theta(n)$ for $p \in (1/2, 1)$, and $n^{\Theta(\log \log n)}$ for $p \in (0, 1/2)$. This improves the previously best known bound $\Omega(1)$ due to Ferber, Krivelevich, Sales and Samotij.

fields

cs.DM 1

years

2026 1

verdicts

UNVERDICTED 1

representative citing papers

citing papers explorer

Showing 1 of 1 citing paper.

  • Entanglement from Expansion: High Rank-Width in Deterministic Graphs cs.DM · 2026-06-05 · unverdicted · none · ref 9 · internal anchor

    Deterministic families of n-vertex graphs achieve provably maximum rank-width Θ(n) via edge-isoperimetric inequalities, strong chromatic index, and a logarithmic strengthening from Boolean analysis.