Education, Mathematics, Math, Science, Technology.
holes as needed. Proof: Let G=(V,E) be a graph. To use induction on the number of edges |E|, consider a graph with only 1 vertex and 0 edges. This graph has 1 face, the exterior face, so 1– 0+ 1 = 2 shows that Euler’s Theorem holds for the base case. For the inductive step, assume Euler’s Theorem