Finite maximal extension for a graph property
ProvedWilliamsonShmoys.finite_maximal_extension__p2m_76998751_2d00_4690_8bec_fa846df46441_a1approximation-algorithmsplanar-graphstreewidth
For any property of simple graphs on a fixed finite ordered vertex type, every graph satisfying the property has a supergraph satisfying it that is maximal among such supergraphs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_maximal_extension__p2m_76998751_2d00_4690_8bec_fa846df46441_a1
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V → Prop) (Y : SimpleGraph V) (hY : P Y) :
∃ Z : SimpleGraph V, Y ≤ Z ∧ P Z ∧
∀ W : SimpleGraph V, Z ≤ W → P W → W ≤ Z := 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).