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

Question

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.

Kunduz · Accepted Answer

Click to see the answer