Maximal extension for a property on finite simple graphs
ProvedWilliamsonShmoys.exists_maximal_property_extensionapproximation-algorithmsplanar-graphstreewidth
For any property of simple graphs on a finite vertex type, every graph satisfying the property has an extension satisfying it that is maximal among such extensions.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_maximal_property_extension
{V : Type} [Fintype V]
(M : SimpleGraph V)
(P : SimpleGraph V → Prop)
(hM : P M) :
∃ L : SimpleGraph V, M ≤ L ∧ P L ∧
∀ K : SimpleGraph V, L ≤ K → P K → K = L := 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).