PlanetMath (more info)
 Math for the people, by the people.
Encyclopedia | Requests | Forums | Docs | Wiki | Random | RSS  
Login
create new user
name:
pass:
forget your password?
Main Menu
sections
Encyclopædia
Papers
Books
Expositions

meta
Requests (200)
Orphanage
Unclass'd
Unproven (490)
Corrections (6)
Classification

talkback
Polls
Forums
Feedback
Bug Reports

downloads
Snapshots
PM Book

information
News
Docs
Wiki
ChangeLog
TODO List
Legalese
About
Owner confidence rating: Very high Entry average rating: No information on entry rating
Euler's polyhedron theorem (Theorem)
Theorem 1   If a connected plane graph has $ n$ vertices, $ m$ edges, and $ f$ faces, then
$\displaystyle n - m + f = 2.$



"Euler's polyhedron theorem" is owned by Mathprof. [ full author list (2) | owner history (1) ]
(view preamble)

View style:

See Also: graph, graph theory, Poincaré formula, polytope

Other names:  Euler's formula
Keywords:  graph, vertex, edge, face, vertices

Attachments:
proof of Euler's polyhedron theorem (Proof) by mps
Log in to rate this entry.
(view current ratings)

Cross-references: faces, edges, vertices, plane graph, connected
There are 6 references to this entry.

This is version 3 of Euler's polyhedron theorem, born on 2002-02-21, modified 2006-10-04.
Object id is 2433, canonical name is EulersPolyhedronTheorem.
Accessed 9045 times total.

Classification:
AMS MSC: 05C99 (Combinatorics :: Graph theory :: Miscellaneous)
Pending Errata and Addenda
None.
[ View all 2 ]
Discussion
Style: Expand: Order:
forum policy

No messages.

Interact
post | correct | update request | prove | add result | add corollary | add example | add (any)