Kalai's separator conjecture for simple polytopes

Let PP be a simple dd-polytope with mm vertices, and let GPG_P be its graph. Kalai's separator conjecture. There exists a subset VV' of vertices of PP such that

V=O(n11d1)|V'|=O\left(n^{1-\frac{1}{d-1}}\right)

and removing VV' from GPG_P separates GPG_P into two parts, each with at least n/3n/3 vertices. The source presents this as a version attributed to Kalai and as a conjecture about vertex expansion; the variables mm and nn are inconsistent in the source statement, and no resolution is given.

Sources & referencesView supporting material

Primary source

Sandeep Koranne and Anand Kulkarni, “Combinatorial Polytope Enumeration”, arXiv:0908.1619 (2009).

Progress summary

Never refreshed

Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.

Solutions 0

No solutions have been posted yet.