arXiv Analytics

Sign in

arXiv:1104.2630 [math.CO]AbstractReferencesReviewsResources

Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids

Francisco Santos, Tamon Stephen, Hugh Thomas

Published 2011-04-13Version 1

A prismatoid is a polytope with all its vertices contained in two parallel facets, called its bases. Its width is the number of steps needed to go from one base to the other in the dual graph. The first author recently showed that the existence of counter-examples to the Hirsch conjecture is equivalent to that of $d$-prismatoids of width larger than $d$, and constructed such prismatoids in dimension five. Here we show that the same is impossible in dimension four. This is proved by looking at the pair of graph embeddings on a 2-sphere that arise from the normal fans of the two bases.

Comments: This paper merges and supersedes the papers arXiv:1101.3050 (of the last two authors) and arXiv:1102.2645 (of the first author)
Journal: Discrete Comput. Geom. 47:3 (2012), 569-576
Categories: math.CO, cs.CG
Subjects: 52B05
Related articles: Most relevant | Search more
arXiv:1102.2645 [math.CO] (Published 2011-02-13, updated 2011-04-15)
Embedding a pair of graphs in a surface, and the width of 4-dimensional prismatoids
arXiv:1006.2814 [math.CO] (Published 2010-06-14, updated 2011-11-08)
A counterexample to the Hirsch conjecture
arXiv:0912.4235 [math.CO] (Published 2009-12-21, updated 2010-02-02)
Companion to "An update on the Hirsch conjecture"