Euler's Graph Theoritic Formula

For students of class 9-10 (age 14-16)
mutasimmim
Posts:107
Joined:Sun Dec 12, 2010 10:46 am
Euler's Graph Theoritic Formula

Unread post by mutasimmim » Fri Mar 27, 2015 8:04 am

Let there be a (simple)graph whose edges only meet at vertices. Let $V,E,F$ be the numbers of vertices,edges and faces (number of regions the graph divides the plane into) respectively. Prove that $V-E+F=2$.

Hint:
There exists at least 3 proofs with induction.
.

Post Reply