Euler upper bound for a drawable simple graph
ProvedWilliamsonShmoys.planar_drawing_maximal_edge_count_repair_543ac5d4_edge_upperapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices has at most edges, stated without truncated subtraction.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_edge_count_repair_543ac5d4_edge_upper
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hU : WilliamsonShmoys.HasPlanarDrawingOn U) :
U.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).