Abstract
A graph is planar if it can be drawn in the plane ℝ2 without crossing edges (or, equivalently, on the 2-dimensional sphere S2). We talk of a plane graph if such a drawing is already given and fixed. Any such drawing decomposes the plane or sphere into a finite number of connected regions, including the outer (unbounded) region, which are referred to as faces. Euler’s formula exhibits a beautiful relation between the number of vertices, edges and faces that is valid for any plane graph. Euler mentioned this result for the first time in a letter to his friend Goldbach in 1750, but he did not have a complete proof at the time. Among the many proofs of Euler’s formula, we present a pretty and “self-dual” one that gets by without induction. It can be traced back to von Staudt’s book “Geometrie der Lage” from 1847.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer-Verlag GmbH Germany, part of Springer Nature
About this chapter
Cite this chapter
Aigner, M., Ziegler, G.M. (2018). Three applications of Euler’s formula. In: Proofs from THE BOOK. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-57265-8_13
Download citation
DOI: https://doi.org/10.1007/978-3-662-57265-8_13
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-57264-1
Online ISBN: 978-3-662-57265-8
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)