Finite maximal edge superset
ProvedWilliamsonShmoys.exists_maximal_edge_superset__p2m_074f37c1_44b5_4e2a_beb4_02cefa9615fb_a1approximation-algorithmsplanar-graphstreewidth
For any predicate on simple graphs over a finite vertex type, every graph satisfying the predicate has a predicate-satisfying edge supergraph maximal under edge inclusion.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_edge_superset__p2m_074f37c1_44b5_4e2a_beb4_02cefa9615fb_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V) (P : SimpleGraph V → Prop) (hP : P H) :
letI : ∀ G : SimpleGraph V, DecidableRel G.Adj :=
fun G => Classical.decRel G.Adj
∃ K : SimpleGraph V,
H.edgeFinset ⊆ K.edgeFinset ∧
P K ∧
∀ G : SimpleGraph V, K.edgeFinset ⊆ G.edgeFinset → P G → G = K := 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).