A simple graph G on n vertices (n ≥ 2) is drawn in the

Last updated: 8/8/2022

A simple graph G on n vertices (n ≥ 2) is drawn in the plane. Prove that if every edge crosses at most one another edge, then the number of edges in G does not exceed 4n-8.