Finite maximality for a predicate on simple graphs
ProvedWilliamsonShmoys.exists_edge_inclusion_maximal_graph__p2m_78ba916f_f700_41ef_a045_eff3bbec17a0_a2approximation-algorithmsplanar-graphstreewidth
On a finite linearly ordered vertex type, every graph satisfying a predicate is contained in a graph that is maximal under edge inclusion among graphs satisfying that predicate.
Preamble
import Mathlib
Formal statement
theorem WilliamsonShmoys.exists_edge_inclusion_maximal_graph__p2m_78ba916f_f700_41ef_a045_eff3bbec17a0_a2 {V : Type} [Fintype V] [LinearOrder V] (P : SimpleGraph V → Prop) (G : SimpleGraph V) (hG : P G) : ∃ H : SimpleGraph V, G.edgeSet ⊆ H.edgeSet ∧ P H ∧ ∀ K : SimpleGraph V, H.edgeSet ⊆ K.edgeSet → P K → K.edgeSet = H.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).