Refine
Year of publication
- 2012 (1)
Language
- English (1)
Keywords
- face numbers of polytopes (1)
- perfect graphs (1)
- split graphs (1)
Project
- F13 (1)
Application Area
- F (1)
We analyze a remarkable class of centrally symmetric polytopes, the Hansen
polytopes of split graphs. We confirm Kalai's 3^d-conjecture for such polytopes
(they all have at least 3^d nonempty faces) and show that the Hanner polytopes
among them (which have exactly 3^d nonempty faces) correspond to threshold
graphs. Our study produces a new family of Hansen polytopes that have only
3^d+16 nonempty faces.