You are on page 1of 5

Section 10

A complete graph contains an edge between every pair of vertices, so there is an edge between a and c. This may as well be inside the pentagon (as if it is outside then we just adjust the following argument appropriately): b

K4,2

The proof is omitted one direction is very hard to prove. It is clear that if a graph contains either K5 or K3,3 then it cannot be planar (since then K5 or K3,3 would be planar). Similarly the same happens for homeomorphic subgraphs, since homeomorphism does not change the planarity of a graph.

67

You might also like