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.
