Finite maximality for graph predicates
ProvedWilliamsonShmoys.exists_supergraph_maximal_for_predicate__p2m_c813e8d9_188c_4202_b644_d7aaf9123e11_a1approximation-algorithmsplanar-graphstreewidth
For any predicate on simple graphs over a finite linearly ordered vertex type, if the predicate holds of a graph M, then M has a predicate-satisfying supergraph that is maximal under edge inclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_supergraph_maximal_for_predicate__p2m_c813e8d9_188c_4202_b644_d7aaf9123e11_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(P : SimpleGraph V → Prop)
(hM : P M) :
∃ N : SimpleGraph V,
Set.Subset M.edgeSet N.edgeSet ∧
P N ∧
∀ Q : SimpleGraph V,
Set.Subset N.edgeSet Q.edgeSet →
P Q →
Set.Subset Q.edgeSet N.edgeSet := 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).