That proof that any convex polyhedron made of pentagons and hexagons must contain at least 12 pentagons rests on Euler’s polyhedron formula: If a convex polyhedron has vertices, edges, and faces, then

So how is *that* proved? Lots of ways, some of which rely on the Jordan curve theorem, so then you need a proof of that. An outline of one that doesn’t use the Jordan curve theorem, Triangle Removal, is as follows.

First, transform the polyhedron into a planar graph. You can think of this as removing one face of the polyhedron, and then stretching the boundaries of that face and deforming the other edges until all the edges lie in a plane. Or you can think of it as putting a light source near one face and a plane on the opposite side: the shadow cast onto the plane is the planar graph. This graph has the same number of vertices and edges as the polyhedron, and apparently one fewer face — until you realize the entire plane exterior to the graph can be thought of as a face too.

Okay, we have our graph. Now do the following: Find any interior face that has more than three edges, and draw a diagonal through it from one vertex to another. Doing that increases the number of edges by 1, and divides one face into two, but leaves the vertices unchanged. That means is unchanged. Repeat that until all the interior faces are triangles.

Now do this:

- Identify a triangle that has two edges on the border of the graph. If you can’t find one, go to step 2. If you can find one, remove those two edges. This eliminates two edges, one face, and one vertex, so again is unchanged. Now repeat step 1.
- Identify a triangle that has one edge on the border of the graph. Remove that edge. This eliminates one edge, one face, and no vertices, so again is unchanged. Now repeat step 1.

Keep repeating as long as you can. Here I get hand wavy, because I’m less than clear on the argument, but: You don’t want to do step 2 if you can do step 1, because that leads to dead ends — specifically, a graph broken up into two disconnected graphs. Always do step 1 if you can, step 2 only if you can’t do step 1, and the graph will stay connected.

For instance, starting from a (kinda irregular) square pyramid. Here it’s turned into a planar graph with one quadrilateral and three triangular faces (the fourth triangle mapping to the exterior of the graph). The quadrilateral is divided into two triangles, and then triangles are removed one at a time.

Since the graph stays connected, the process continues until there’s only one triangle left. At this point we stop and take a tally: There are 3 vertices, 3 edges, and 2 faces (the interior of the triangle, and the exterior). So , and since every step we took preserved the value of this proves for the original polyhedron.

Something about that proof appeals to me, even though there’s that one part I’m hazy on.

The Sum of Angles proof I find clearer, but less cute. Here again you turn the polyhedron into a planar graph with straight edges. Now add up the interior angles of all the faces (including the exterior face). For face , which has edges, the sum of the interior angles is . Summing over all the faces,

But we get the same result if we sum the angles meeting at each vertex. For each interior vertex, the sum is , adding up to where is the number of vertices on the border. For the vertices on the border, it’s where is the exterior angle at the th vertex of the exterior polygon, and the 2 is because we include the (equal) contributions of the internal and external polygons. But the sum of the exterior angles of a polygon is , so the exterior vertices contribute a total of . Altogether, then, the sum is .

So , or ,

Either way, no Jordan curve theorem required! Yay.