Finite maximal supergraph for an arbitrary graph property
ProvedWilliamsonShmoys.exists_maximal_supergraph__p2m_3d3a53f5_6da9_483c_b0e6_94f0720675a5_a1approximation-algorithmsplanar-graphstreewidth
For any property of simple graphs on a finite vertex type, every graph satisfying the property has a supergraph satisfying it that is maximal among such supergraphs.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_supergraph__p2m_3d3a53f5_6da9_483c_b0e6_94f0720675a5_a1 {V : Type} [Fintype V] (P : SimpleGraph V → Prop) (G : SimpleGraph V) (hG : P G) : ∃ H : SimpleGraph V, G ≤ H ∧ P H ∧ (∀ K : SimpleGraph V, H ≤ K → P K → K ≤ H) := 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).