ABSTRACT
We’re just doing the boring old topics of planar graphs and Euler’s formula. Total joke-these are pretty much the most fun ever.
Kn: The complete graph on n vertices (just as a reminder).
Kn,m: The complete bipartite graph with n vertices in one part and m vertices in the other part (just as a reminder).
