Planar simple graphs have at most 3n minus 6 edges
ProvedWilliamsonShmoys.planar_edge_upper_bound__p2m_ac994e54_6c64_49c2_8ec9_d8877c55139c_a1approximation-algorithmsplanar-graphstreewidth
Any simple graph with at least three vertices and a drawing satisfying HasPlanarDrawingOn has at most 3n−6 edges. This is the Euler-formula and face-incidence upper bound; for a disconnected drawing, connect its components by noncrossing arcs before applying the connected bound.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_upper_bound__p2m_ac994e54_6c64_49c2_8ec9_d8877c55139c_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
K.edgeSet.ncard + 6 <= 3 * Fintype.card V := by sorrySource
David P. Williamson and David B. Shmoys, The Design of Approximation Algorithms, Cambridge University Press, 2011, author electronic manuscript, Section 10.2, proof of Theorem 10.11, pp. 270-272. https://doi.org/10.1017/CBO9780511921735. Bounded tree-width of the pieces: Robertson–Seymour (planar graphs of radius r have tree-width at most 3r+1) / Bodlaender (k-outerplanar graphs have tree-width at most 3k-1).