Planar edge-count upper bound
ProvedWilliamsonShmoys.planar_edge_count_upper_bound__p2m_7faa0883_91bf_4801_b0cf_9d9827720e15_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has at most 3n−6 edges. This isolates the Euler-formula upper-bound argument from maximality.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_bound__p2m_7faa0883_91bf_4801_b0cf_9d9827720e15_a1 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) (hV : 3 ≤ Fintype.card V) (hDraw : HasPlanarDrawingOn L) : L.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).