6
$\begingroup$

It is easy to find three triangulations, each consisting of four tetrahedra. Are there more?

$\endgroup$

1 Answer 1

15
$\begingroup$

No, these are all. The edge graph of the octahedron has no $K_4$ subgraph, so you have to add a new edge to make a triangulation. The only possible places for a new edge are connecting opposite vertices. You can only add one such edge, as any two meet in their interior. So every triangulation of the octahedron (without new vertices) adds exactly one of the three edges $e$ between opposite vertices. The only $K_4$'s in that graph are the four tetrahedra arranged around $e$, so any traingulation using $e$ must use a subset of those tetrahedra. We need all of them to fill in the octahedron.

$\endgroup$
3
  • $\begingroup$ "You can only add one such edge" -- Why can't you have 2 edges crossing each other? You first divide the octahedron into 2 square pyramids, then each pyramid into 2 tetrahedra. This would give a total of 3+2*3 = 9 triangulations. $\endgroup$
    – Wood
    Jan 4, 2018 at 5:06
  • 2
    $\begingroup$ Because a triangulation of a polytope $P$, by definition, is a collection of simplices whose union is $P$ and where any two simplices intersect in a common face of both. (See, for example, the textbook of de Loera, Rambau and Santos.) $\endgroup$ Jan 4, 2018 at 14:06
  • $\begingroup$ Thanks! I just want to point out that your definition doesn't seem to agree with the one given on this question: mathoverflow.net/questions/45863/triangulations-of-polyhedra $\endgroup$
    – Wood
    Jan 6, 2018 at 3:15

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

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