Simple planar edge bound without connectedness
ProvedWilliamsonShmoys.simple_planar_edge_bound_any_componentsapproximation-algorithmsplanar-graphstreewidth
Every finite simple graph with at least three vertices and a drawing satisfying HasPlanarDrawingOn has at most 3|V| - 6 edges, whether or not it is connected.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.simple_planar_edge_bound_any_components
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hLdraw : WilliamsonShmoys.HasPlanarDrawingOn L)
(hCard : 3 ≤ Fintype.card V) :
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).