e = edges
v = vertices
but what is n?
The converse of the Upper Bound Theorem would state that a graph which satisfies the inequality is planar.
This converse is not true as seen in picture.
Verify that the inequality is true for this graph. Once done, use the inside-outside algorithm to show that the graph is actually non-planar.