Maximal extension in a finite preorder
ProvedWilliamsonShmoys.finite_simpleGraph_supergraph_maximal__p2m_7fc18aad_d07a_49bb_b01c_abff1eddf2b3_a1approximation-algorithmsplanar-graphstreewidth
In a finite preorder, every element satisfying a predicate has a predicate-satisfying extension that is maximal among predicate-satisfying elements above it.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_simpleGraph_supergraph_maximal__p2m_7fc18aad_d07a_49bb_b01c_abff1eddf2b3_a1 {α : Type} [Finite α] [Preorder α] (x : α) (Q : α → Prop) (hx : Q x) : ∃ y : α, And (Q y) (And (x ≤ y) (∀ z : α, Q z → y ≤ z → z ≤ y)) := 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).