Planar edge bound for disconnected graphs
ProvedWilliamsonShmoys.planar_edge_count_of_disconnectedapproximation-algorithmsplanar-graphstreewidth
A disconnected finite simple graph with a crossing-free drawing and at least three vertices has at most 3|V|−6 edges. Restrict the drawing to each connected component. Components of size at least three satisfy the connected planar estimate; components of size one or two satisfy the elementary bounds from simplicity. Count each edge in its unique component and sum. Since there are at least two nonempty components, the componentwise losses give the required total allowance of six.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_of_disconnected
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V)
(hdisconn : ¬ G.Connected) :
G.edgeSet.ncard ≤ 3 * Fintype.card V - 6 := 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).