Talk:Euler Polyhedron Formula

This one's been on my list of proofs to work on for some time. I was going to approach it by proving the result for planar graphs first, in a separate proof, effectively the same as what's been done here. Then the plan was to prove the duality between polyhedra and planar graphs (is "duality" the name I need here? Probably not), and then demonstrate that this result follows from those two.

As the definitions have not been done yet, this page ends up being a bit thin ... No matter, we've got something to work on now. --Matt Westwood 21:11, 14 April 2010 (UTC)

"Duality" is probably not the term you want, because that means dichotomy or two-things, and we should communicate the fact that they are equivalent. Colors

Equivalence works better, agreed. But - and it's significant - although every polyhedron can be represented as a planar graph, not every planar graph represents a polyhedron. I'll see to it as and when. --Matt Westwood 20:41, 15 April 2010 (UTC)