Finite maximal extension for monotone graph predicates
ProvedWilliamsonShmoys.finite_predicate_maximal_extension__p2m_168460db_bad2_471e_a83e_74dae3ce8af4_a1approximation-algorithmsplanar-graphstreewidth
On a finite vertex type, every graph satisfying an upward-monotone predicate has a predicate-satisfying supergraph that is maximal under graph inclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_predicate_maximal_extension__p2m_168460db_bad2_471e_a83e_74dae3ce8af4_a1
{V : Type} [Fintype V]
(T : SimpleGraph V)
(P : SimpleGraph V → Prop)
(hT : P T)
(hmono : ∀ G H : SimpleGraph V, G ≤ H → P G → P H) :
∃ U : SimpleGraph V,
T ≤ U ∧ P U ∧
∀ W : SimpleGraph V, U ≤ W → P W → W = U := 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).