Euler's Formula and Its Applications in Graph Theory
One of the most elegant and foundational facts in graph theory is Euler's Formula. Named after the
prolific mathematician Leonhard Euler, this formula applies to planar graphs and establishes a
fascinating relationship between the number of vertices, edges, and faces in a connected planar
graph. Euler's Formula states that for any connected planar graph, the number of vertices (V),
edges (E), and faces (F) are related by the equation:
V-E+F=2
This simple yet powerful formula has profound implications and applications in various fields,
including topology, polyhedral combinatorics, and computer science.
Leonhard Euler first introduced this formula in 1758 while studying the properties of polyhedra. Euler
observed that for any convex polyhedron, if one counts the number of vertices (corners), edges
(lines), and faces (flat surfaces), the relationship V - E + F = 2 holds true. This discovery laid the
groundwork for the field of topology and led to the development of graph theory as a mathematical
discipline.
To understand why Euler's Formula holds for planar graphs, let's consider a connected planar
graph. A planar graph can be drawn on a plane without any of its edges crossing. Here's a
step-by-step proof of Euler's Formula:
1. Base Case: Consider the simplest planar graph, a single vertex with no edges. Here, V = 1, E = 0,
and F = 1 (the whole plane is considered a face). Plugging these values into Euler's Formula, we
get:
1-0+1=2
So, the formula holds for the base case.
2. Inductive Step: Assume Euler's Formula holds for a planar graph with n vertices. We need to
show it holds for a graph with n+1 vertices.
