Euler edge bound for a drawable simple graph
ProvedWilliamsonShmoys.maximal_drawable_edge_count_planar_upper_boundapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has at most three times its vertex count minus six edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawable_edge_count_planar_upper_bound {V : Type} [Fintype V] [LinearOrder V] (T : SimpleGraph V) (hTdraw : WilliamsonShmoys.HasPlanarDrawingOn T) (hCard : 3 ≤ Fintype.card V) : T.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).