Planar simple graphs have at most 3n−6 edges
ProvedWilliamsonShmoys.planar_edge_upper_bound__p2m_f3b09488_81b3_4c0a_8ec2_c4e84638c6d1_a11approximation-algorithmsplanar-graphstreewidth
A finite simple graph with a crossing-free drawing and at least three vertices has at most 3|V|−6 edges. This removes the upper-bound half from the parent. Prove it by deriving the planar Euler inequality from the drawing, including disconnected graphs, bounding face-edge incidences, and preserving the |V| = 3 cutoff. It is a new topological counting obligation, not an existing platform declaration.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Data.Fintype.Basic import Mathlib.Data.Set.Card set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_upper_bound__p2m_f3b09488_81b3_4c0a_8ec2_c4e84638c6d1_a11
{V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V)
(hDrawing : WilliamsonShmoys.HasPlanarDrawingOn H)
(hV : 3 <= Fintype.card V) :
H.edgeSet.ncard <= 3 * Fintype.card V - 6 := 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).