A nonempty finite family of graph extensions has a maximal member
ProvedWilliamsonShmoys.finite_extension_maximal_property__p2m_73c85c29_4333_4692_baee_7210fe30cead_a2approximation-algorithmsplanar-graphstreewidth
For a finite vertex type, if some graph extending M satisfies P, then there is a P graph extending M with no strictly larger P graph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open SimpleGraph
Formal statement
theorem WilliamsonShmoys.finite_extension_maximal_property__p2m_73c85c29_4333_4692_baee_7210fe30cead_a2
{V : Type} [Fintype V]
(M : SimpleGraph V)
(P : SimpleGraph V -> Prop)
(hP : exists G : SimpleGraph V, M <= G /\ P G) :
exists N : SimpleGraph V,
M <= N /\
P N /\
forall K : SimpleGraph V, N <= K -> P K -> K = N := 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).