Planar drawing edge upper bound
ProvedWilliamsonShmoys.planar_drawing_edge_upper_bound_repair3approximation-algorithmsplanar-graphstreewidth
Every graph with a crossing-free drawing on at least three finite vertices has at most 3 * |V| - 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Data.Set.Card set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_edge_upper_bound_repair3
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hHdraw : HasPlanarDrawingOn H) :
H.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).