Kalai's separator conjecture for simple polytopes
Kalai's separator conjecture for simple polytopes
Let be a simple -polytope with vertices, and let be its graph. Kalai's separator conjecture. There exists a subset of vertices of such that
and removing from separates into two parts, each with at least vertices. The source presents this as a version attributed to Kalai and as a conjecture about vertex expansion; the variables and 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
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
Sign in to submit a solution.
No solutions have been posted yet.