arXiv Analytics

Sign in

arXiv:1009.1499 [math.MG]AbstractReferencesReviewsResources

Polytopality and Cartesian products of graphs

Julian Pfeifle, Vincent Pilaud, Francisco Santos

Published 2010-09-08Version 1

We study the question of polytopality of graphs: when is a given graph the graph of a polytope? We first review the known necessary conditions for a graph to be polytopal, and we provide several families of graphs which satisfy all these conditions, but which nonetheless are not graphs of polytopes. Our main contribution concerns the polytopality of Cartesian products of non-polytopal graphs. On the one hand, we show that products of simple polytopes are the only simple polytopes whose graph is a product. On the other hand, we provide a general method to construct (non-simple) polytopal products whose factors are not polytopal.

Comments: 21 pages, 10 figures
Journal: Israel J. Math., 192(1):121-141, 2012
Categories: math.MG, math.CO
Subjects: 52B05, 52B11, 05C62
Related articles: Most relevant | Search more
arXiv:1708.06718 [math.MG] (Published 2017-08-22)
Simple polytopes without small separators, II: Thurston's bound
arXiv:1510.00511 [math.MG] (Published 2015-10-02)
Simple polytopes without small separators
arXiv:1906.11433 [math.MG] (Published 2019-06-27)
Necessary conditions for the extendibility of a first-order flex of a polyhedron to its flex