 Thus, we may assume that ≥ 4.By Euler's formula for planar graphs, has edges; equivalently, if one defines the "deficiency" of a vertex in to be , the sum of the deficiencies is .Since has at least four vertices and all faces of are triangles, it follows that every vertex in has degree at least three.