Reconstructing a non-simple polytope from its graph

Simple item page
dc.creatorJoswig, Michael
dc.date1999-09-29
dc.date.accessioned2026-07-07T05:30:56Z
dc.date.available2026-07-07T05:30:56Z
dc.descriptionA well-known theorem of Blind and Mani says that every simple polytope is uniquely determined by its graph. 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.
dc.description10 pages, 7 figures, latex2e
dc.identifierhttps://arxiv.org/abs/math/9909170
dc.identifierhttp://arxiv.org/abs/math/9909170
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/79164
dc.subjectCombinatorics
dc.subjectMetric Geometry
dc.subject52Bxx (05C99)
dc.titleReconstructing a non-simple polytope from its graph
dc.typetext

Files

Collections

arXiv