Finite connected supergraph from a strict one-step extension
ProvedWilliamsonShmoys.finite_connected_supergraph_from_one_stepapproximation-algorithmsplanar-graphstreewidth
For a finite ordered vertex type, if every disconnected P-supergraph of W admits a strict P-supergraph, then W has a connected P-supergraph.
Preamble
import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected
Formal statement
theorem WilliamsonShmoys.finite_connected_supergraph_from_one_step
{V : Type} [Fintype V] [LinearOrder V]
(W : SimpleGraph V) (P : SimpleGraph V → Prop)
(hP : P W)
(hStep : ∀ G : SimpleGraph V, W ≤ G → P G → ¬ G.Connected →
∃ K : SimpleGraph V, G ≤ K ∧ G ≠ K ∧ P K) :
∃ H : SimpleGraph V, W ≤ H ∧ H.Connected ∧ P 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).