In a country, 5 lakes are connected by 10 channels. Show that some of the channels must intersect. Show that in a planar graph at least one vertex has degree less than 6. Show that if a planar graph with number of edges Ek has no cycles of length less than k, then 2E> KF, where F is the number of faces.