Planar Graph Edge Bound (Euler's Formula, 3n−6)

Every simple planar graph on n ≥ 3 vertices has at most 3n−6 edges — a direct consequence of Euler's formula, and an instant non-planarity test.