Connected planar augmentation on the same vertices
ProvedWilliamsonShmoys.connected_planar_augmentationapproximation-algorithmsplanar-graphstreewidth
Any graph on at least three vertices with the given crossing-free drawing can be extended, on the same vertex type, to a connected graph with a crossing-free drawing, without removing edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.connected_planar_augmentation
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ H : SimpleGraph V,
G ≤ H ∧ H.Connected ∧ WilliamsonShmoys.HasPlanarDrawingOn H ∧
G.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).