Abstract
In Chapter 11 we considered problems that can be cast in the language of graph theory: If we draw some special graphs in the plane, into how many parts do these graphs divide the plane? Indeed, we start with a set of lines; we consider the intersections of the given lines as nodes of the graph, and the segments arising on these lines as the edges of our graph. (For the time being, let us forget about the infinite half-lines. We’ll come back to the connection between graphs and sets of lines later.)
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
© 2003 Springer Science+Business Media, LLC
About this chapter
Cite this chapter
Lovász, L., Pelikán, J., Vesztergombi, K. (2003). Euler’s Formula. In: Discrete Mathematics. Undergraduate Texts in Mathematics. Springer, New York, NY. https://doi.org/10.1007/0-387-21777-0_12
Download citation
DOI: https://doi.org/10.1007/0-387-21777-0_12
Publisher Name: Springer, New York, NY
Print ISBN: 978-0-387-95585-8
Online ISBN: 978-0-387-21777-2
eBook Packages: Springer Book Archive