Iterate strict planar edge extensions to connectivity
ProvedWilliamsonShmoys.finite_planar_bridge_iteration__p2m_ce6f5f96_18b4_457b_8f01_9dcd9d3bda8a_a1approximation-algorithmsplanar-graphstreewidth
If every disconnected drawable supergraph of a finite drawable graph admits a strict drawable edge extension, then there is a connected drawable supergraph containing the initial graph, with at least as many edges. Prove this by maximizing edge count among the finitely many simple graphs on the vertex type; a disconnected maximizer would admit a strict extension.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_planar_bridge_iteration__p2m_ce6f5f96_18b4_457b_8f01_9dcd9d3bda8a_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hStep : ∀ K : SimpleGraph V, G ≤ K →
WilliamsonShmoys.HasPlanarDrawingOn K → ¬ K.Connected →
∃ L : SimpleGraph V,
K ≤ L ∧ K.edgeSet ⊂ L.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ 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).