Upper edge bound for a disconnected drawable graph
ProvedWilliamsonShmoys.planar_drawable_edge_count_upper_disconnectedapproximation-algorithmsplanar-graphstreewidth
A disconnected finite simple graph with at least three vertices and a crossing-free drawing has at most 3|V| − 6 edges. Restrict the drawing to its connected components; prove the Euler bound for components of size at least three, bound the smaller components directly, then sum the component estimates. The total-size hypothesis is needed to recover the additive six in the final bound.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawable_edge_count_upper_disconnected
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) (hdisc : ¬ K.Connected) :
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).