Connected drawable supergraph on the same vertices
ProvedWilliamsonShmoys.connected_planar_supergraph__p2m_11b8d141_5db8_4e85_8178_19adf7dd7abd_a1approximation-algorithmsplanar-graphstreewidth
Any drawable finite simple graph on at least three vertices admits a connected drawable supergraph on the same vertices whose edge count is no smaller. This removes disconnectedness from the parent argument. The route is to connect components through the complement of the finite drawing, preserving the original edges and vertex set; the lower bound of three vertices is preserved, including at equality.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_supergraph__p2m_11b8d141_5db8_4e85_8178_19adf7dd7abd_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V) :
∃ H : SimpleGraph V,
WilliamsonShmoys.HasPlanarDrawingOn H ∧
H.Connected ∧
K.edgeSet.ncard ≤ H.edgeSet.ncard := 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).