Reconstructing a non-simple polytope from its graph

Details Reconstructing a non-simple polytope from its graph Reconstructing a non-simple polytope from its graph

1999-09-29

arxiv.org/abs/math/9909170v1

Mathematics

Combinatorics

10 pages, 7 figures, latex2e

Scientific paper

A 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.

Affiliated with

Also associated with

No associations

Rating

Reconstructing a non-simple polytope from its graph does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Reconstructing a non-simple polytope from its graph, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Reconstructing a non-simple polytope from its graph will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548521