Euler's formula tells us that, for any planar embedding of a connected planar graph, the number of vertices minus the number of edges plus the number of faces (including the unbounded face) is always 2. This amazing fact is proven in our video by induction. A part of the argument is to do casework on whether we have a cycle or the graph is a tree.
Like, subscribe, and share! To find out more about us:
- Visit [ Ссылка ] to check out our services
- Get our Rigorous Elementary Mathematics books on Amazon: [ Ссылка ]
Copyright © Existsforall Academy Inc. All rights reserved.
