Connected planar supergraph extension
ProvedWilliamsonShmoys.planar_drawing_connected_extension_existsapproximation-algorithmsplanar-graphstreewidth
Every finite graph on at least three ordered vertices with the specified planar drawing has a connected planar supergraph on the same vertex type.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_connected_extension_exists
{V : Type} [Fintype V] [LinearOrder V]
(Y : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hY : WilliamsonShmoys.HasPlanarDrawingOn Y) :
∃ Z : SimpleGraph V,
Y ≤ Z ∧ Z.Connected ∧ WilliamsonShmoys.HasPlanarDrawingOn Z := 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).