On the edge expansion of random polytopes
Asaf Ferber, Michael Krivelevich, Marcelo Sales, Wojciech Samotij
2026年份
2被引次数
摘要
A 0/1-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 0/1-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 0/1-polytope is bounded from below by an absolute constant.
问问这篇 Paper
智能体会读完全文。
Lune 把这篇 Paper 索引到了每一个公式,引用它的顶会 Paper 也一样。你提问,回答直接引用原文。
相关 Paper
- Towards the Erdős-Gallai Cycle Decomposition ConjectureMatija Bucic, Richard MontgomerySTOC 2023
- Cheeger Inequalities for Vertex Expansion and Reweighted EigenvaluesTsz Chiu Kwok, Lap Chi Lau, Kam Chuen TungFOCS 2022 · 被引用 5 次
- Local and Global Expansion in Random Geometric GraphsSiqi Liu, Sidhanth Mohanty, Tselil Schramm, Elizabeth YangSTOC 2023 · 被引用 4 次
- The Connectivity Threshold for Dense GraphsAnupam Gupta, Euiwoong Lee, Jason LiSODA 2021 · 被引用 2 次
- First order distinguishability of sparse random graphsTal Hershko, Maksim ZhukovskiiLICS 2024
