2 ms·
Another favorite is Steinitz's theorem: the graphs of the $3$-dimensional convex polyhedra are precisely the $3$-connected planar graphs. The proof isn't hard
by pmiller2 17y ago
Another favorite is Steinitz's theorem: the graphs of the $3$-dimensional convex polyhedra are precisely the $3$-connected planar graphs.
The proof isn't hard, but a bit too long for this space. :-)