Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. Join them; it only takes a minute:

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

What does it mean for two polyhedra to be combinatorially equivalent? I've looked on the internet but in vain. If it's not a standard definition, then it might help to say that I found this term in a paper on flattening polyhedra: Continuous flattening of convex polyhedra by Jin-ichi Itoh et al.

share|cite|improve this question
up vote 4 down vote accepted

The set of all faces of a polytope, partially ordered by inclusion, is called its face lattice. Two polytopes are combinatorially equivalent if they have isomorphic face lattices.

A nice introduction to the combinatorial aspects of polytopes can be found in this pdf.

An equivalent condition for combinatorial equivalence between two polytopes is that their face-vertex incidence matrices differ only by column and row permutations.

share|cite|improve this answer

For convex 3-dimensional polyhedra you can determine if two such polyhedra are combinatorially equivalent by looking at their vertex-edge graphs. It is known that a graph is the vertex-edge graph of a convex 3-dimensional polyhedron if and only if the graph is planar and 3-connected (Steinitz's Theorem). So if two convex 3-dimensional polyhedra have graphs which are isomorphic they are combinatorially equivalent. For higher dimensional convex polytopes you have to look at the face lattices.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.