Maximal finite graph satisfying a predicate
Provedexists_maximal_element_for_graph_predicate__p2m_a6c79c1c_4522_4952_80c8_2c98cd425351_a2approximation-algorithmsplanar-graphstreewidth
For any predicate on simple graphs over a finite vertex type, every graph satisfying the predicate is contained in a predicate-satisfying graph whose edge set is maximal under inclusion.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem exists_maximal_element_for_graph_predicate__p2m_a6c79c1c_4522_4952_80c8_2c98cd425351_a2 {V : Type} [Fintype V] (P : SimpleGraph V → Prop) (M : SimpleGraph V) (hM : P M) : ∃ K : SimpleGraph V, P K ∧ M.edgeSet ⊆ K.edgeSet ∧ ∀ L : SimpleGraph V, P L → K.edgeSet ⊆ L.edgeSet → L.edgeSet ⊆ K.edgeSet := 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).