what is the maximum number of faces with m edge and n vertex in planar graphs?
e=number of edges
v=number of vertices
f= number of faces
for example if v=3 -> max(f)=2
v=4 -> max(f)=4 (a triangle with a point in inner face of it , connected to the three vertex)