Connect a planar drawing while preserving its edges
DisprovedWilliamsonShmoys.planar_drawing_connected_augmentation_v2approximation-algorithmsplanar-graphstreewidth
Given a finite drawn graph, extend it on the same vertex type to a connected graph with a planar drawing while preserving every edge and not decreasing the edge count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.planar_drawing_connected_augmentation_v2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
Exists fun H : SimpleGraph V =>
(forall u v : V, K.Adj u v -> H.Adj u v) /\
K.edgeSet.ncard <= H.edgeSet.ncard /\
H.Connected /\
WilliamsonShmoys.HasPlanarDrawingOn H := 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).