Finite maximal supergraph for a graph property
ProvedWilliamsonShmoys.finite_maximal_supergraph__p2m_abbad492_aa2c_464e_8cb6_154e5e3bb3de_a1approximation-algorithmsplanar-graphstreewidth
For any property of simple graphs on a finite vertex type, if H has that property, then H has a property-preserving supergraph that is inclusion-maximal among graphs with the property.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.finite_maximal_supergraph__p2m_abbad492_aa2c_464e_8cb6_154e5e3bb3de_a1
{V : Type} [Fintype V]
(P : SimpleGraph V → Prop)
(H : SimpleGraph V)
(hP : P H) :
∃ K : SimpleGraph V,
H ≤ K ∧ P K ∧
(∀ L : SimpleGraph V, K ≤ L → P L → L = K) := 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).