Finite maximal supergraph for a downward-closed property
ProvedWilliamsonShmoys.exists_maximal_supergraph_of_downward_closedFor a finite vertex type, every graph satisfying a downward-closed property is contained in an inclusion-maximal graph satisfying that property.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_supergraph_of_downward_closed
{V : Type} [Fintype V] [DecidableEq V]
(P : SimpleGraph V → Prop)
(hdown : ∀ ⦃G H : SimpleGraph V⦄, G ≤ H → P H → P G)
(G : SimpleGraph V) (hG : P G) :
∃ L : SimpleGraph V, G ≤ L ∧ P L ∧
∀ K : SimpleGraph V, L ≤ K → P K → K ≤ L := 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).