Finite ascent reaches a connected graph
ProvedWilliamsonShmoys.finite_graph_extension_ascentapproximation-algorithmsplanar-graphstreewidth
For any predicate on graphs over a finite vertex type, if the initial graph satisfies the predicate and every disconnected satisfying extension admits a strictly larger satisfying extension, then there is a connected satisfying extension with at least as many edges as the initial graph.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_graph_extension_ascent {V : Type} [Fintype V] (K : SimpleGraph V) (P : SimpleGraph V → Prop) (hP : P K) (hstep : ∀ (L : SimpleGraph V), K ≤ L → P L → ¬ L.Connected → ∃ M : SimpleGraph V, L ≤ M ∧ P M ∧ L.edgeSet.ncard < M.edgeSet.ncard) : ∃ L : SimpleGraph V, K ≤ L ∧ L.Connected ∧ P L ∧ K.edgeSet.ncard ≤ L.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).