A finite graph G(V,E) on n points is drawn in the plane. For an edge e of the graph, let χ(e) denote the number of edges that cross over edge e. Prove that e∈E∑χ(e)+11≤3n−6.Proposed by Dömötör Pálvölgyi, Budapest combinatoricskomalplanar graphgraph theory