Abstract
A well-known theorem of Blind and Mani [4] says that every simple polytope is uniquely determined by its graph. In [11] Kalai gave a very short and elegant proof of this result using the concept of acyclic orientations. As it turns out, Kalai’s proof can be suitably generalized without much effort. We apply our results to a special class of cubical polytopes.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
H. Achatz and P. Kleinschmidt. Reconstructing a simple polytope from its graph, this Volum, 155–165.
A. Björner, P.H. Edelman, and G.M. Ziegler, Hyperplane arrangements with a lattice of regions,Discrete Comput. Geom. 5 (1990), no. 3, 263–288.
G. Blind and R. Blind, Cubical 4-polytopes with few vertices, Geom. Dedicata 66 (1997), no. 2, 223–231.
R. Blind and P. Mani, On puzzles and polytope isomorphisms, Aequationes Math. 34 (1987), 287–297.
H. Bruggesser and P. Mani, Shellable decompositions of cells and spheres, Math. Scandinay. 29 (1971), 197–205.
R. Cordovil, K. Fukuda, and A. Guedes, De OliveiraOn the cocircuit-graph of an oriented matriod, preprint, March 3, 1999. 197–205
F.J. Brandenburg, Graphlet, Version 5.0, http://www.fmi.uni-passau.de/Graphlet, Jan 11, 1999.
E. Gawrilow and M. Joswig, polymake: a framework for analyzing convex polytopes, this volume 5, 43–74.
B. Grünbaum, Convex polytopes, 1967.
M. Joswig and G.M. Ziegler,Neighborly cubical polytopes, Discrete Comput. Geometry (to appear), math 1969 8 981–2033.
G. Kalai, A simple way to tell a simple polytope from its graph, J. Combin. Th., Ser. A 49 (1988), 381–383.
S. Levy, T. Münzner, and M. Phillips, Geomview, Version 1.6.1, http://www.geom.umn.edu/software/geomview, Oct 30, 1997.
G.M. Ziegler, Lectures on polytopes, Springer, 1998, 2nd ed. Michael Joswig
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer Basel AG
About this chapter
Cite this chapter
Joswig, M. (2000). Reconstructing a Non-simple Polytope from its Graph. In: Kalai, G., Ziegler, G.M. (eds) Polytopes — Combinatorics and Computation. DMV Seminar, vol 29. Birkhäuser, Basel. https://doi.org/10.1007/978-3-0348-8438-9_8
Download citation
DOI: https://doi.org/10.1007/978-3-0348-8438-9_8
Publisher Name: Birkhäuser, Basel
Print ISBN: 978-3-7643-6351-2
Online ISBN: 978-3-0348-8438-9
eBook Packages: Springer Book Archive