Finite maximal extension for a predicate on simple graphs
ProvedWilliamsonShmoys.finite_maximal_extension_on_finite_simple_graphsFor any predicate on simple graphs over a finite vertex type, every graph satisfying the predicate has a supergraph satisfying it that is maximal under graph inclusion.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_maximal_extension_on_finite_simple_graphs
{V : Type} [Fintype V]
(P : SimpleGraph V → Prop) (H : SimpleGraph V) (hH : 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).