Finite downward-closed graph properties have maximal extensions
ProvedSimpleGraph.exists_maximal_supgraph_of_finite__p2m_2dea5b09_c429_4a5e_b3c1_b82fac24916e_a2On a finite vertex type, every graph satisfying a downward-closed graph property is contained in a graph maximal among those satisfying the property.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem SimpleGraph.exists_maximal_supgraph_of_finite__p2m_2dea5b09_c429_4a5e_b3c1_b82fac24916e_a2
{V : Type} [Fintype V] (P : SimpleGraph V → Prop)
(hdown : ∀ ⦃G H : SimpleGraph V⦄, H ≤ G → P G → P H)
(K : SimpleGraph V) (hK : P K) :
∃ L : SimpleGraph V, K ≤ L ∧ P L ∧
∀ M : SimpleGraph V, L ≤ M → P M → M ≤ 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).