Euler's formula gives a beautiful relation among the vertices, edges, and faces of a connected planar graph. In the talk, we study this formula and if the time permits, we will also study a proof of Sylvester-Gallai and Pink's theorems by using this formula.
