Every face must have at least 3 edges, and each edge is shared between 2 faces. So .

Not true. For example, the graph of a tetrahedron has 4 vertices and 6 edges (see attached image). What is true is that a plane graph with vertices has at most 3v - 6 edges. The proof is the same as for the previous result: together with .