Proving Euler's Polyhedral Formula by Deleting Edges

Опубликовано: 13 Февраль 2026
на канале: Wolfram Demonstrations Project
292
0

http://demonstrations.wolfram.com/Pro...

The Wolfram Demonstrations Project contains thousands of free interactive visualizations, with new entries added daily.

For a polyhedron P, let V be the number of vertices, E the number of edges, and F the number of faces. Then Euler's polyhedral formula of 1752 is V-E+F=2. There are more than a dozen ways to prove this. Here is one such proof. First, cut P apart along e...

Contributed by: George Beck