Connected drawable extension preserving vertices and edge count
ProvedWilliamsonShmoys.planar_connected_extension__p2m_212795a8_c633_43e2_bc24_6d65a9f436cf_a2approximation-algorithmsplanar-graphstreewidth
A drawable finite simple graph on at least three vertices has a connected drawable supergraph on the same vertices with at least as many edges. The vertex-count hypothesis is inherited from the parent; connecting components by arcs in the complement of the finite drawing preserves the existing drawing and adds edges without crossings. This removes disconnectedness from the parent’s edge-bound argument. The remaining work is formalizing the component-joining construction for the given drawing predicate.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_connected_extension__p2m_212795a8_c633_43e2_bc24_6d65a9f436cf_a2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V) :
∃ H : SimpleGraph V,
K.edgeSet.ncard ≤ H.edgeSet.ncard ∧
WilliamsonShmoys.HasPlanarDrawingOn H ∧ H.Connected := 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).