Euler upper bound for a planar drawing
ProvedWilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_1258d26f_3604_445e_9011_471047f5700d_a1approximation-algorithmsplanar-graphstreewidth
Every finite simple graph with at least three vertices and a drawing satisfying HasPlanarDrawingOn has at most 3|V| - 6 edges. The additive form avoids subtraction side conditions.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_count_upper_bound__p2m_1258d26f_3604_445e_9011_471047f5700d_a1 {V : Type} [Fintype V] [LinearOrder V] (K : SimpleGraph V) (hK : HasPlanarDrawingOn K) (hV : 3 ≤ Fintype.card V) : 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).