Extend a planar drawing to a connected graph
DisprovedWilliamsonShmoys.planar_drawing_connected_extension__p2m_1bec9fe1_f96d_4d95_8b96_08ac82faf267_a8approximation-algorithmsplanar-graphstreewidth
Every finite graph with the supplied planar drawing has a connected supergraph on the same vertices with a planar drawing, whose edge count is at least the original edge count.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_connected_extension__p2m_1bec9fe1_f96d_4d95_8b96_08ac82faf267_a8
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧ N.Connected ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
(M.edgeSet.ncard : Int) ≤ (N.edgeSet.ncard : Int) := 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).