Finite maximal extension for hereditary graph properties
Provedexists_maximal_supergraph_of_hereditary_property__p2m_4d37fe7f_2e72_452b_8439_d9da71f76f12_a2On a finite vertex type, a graph satisfying an edge-hereditary property has a supergraph satisfying that property which is maximal under edge inclusion.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem exists_maximal_supergraph_of_hereditary_property__p2m_4d37fe7f_2e72_452b_8439_d9da71f76f12_a2
{V : Type} [Fintype V]
(P : SimpleGraph V → Prop)
(K : SimpleGraph V)
(hK : P K)
(hhered : ∀ G H : SimpleGraph V, H.edgeSet ⊆ G.edgeSet → P G → P H) :
∃ N : SimpleGraph V,
K.edgeSet ⊆ N.edgeSet ∧
P N ∧
∀ M : SimpleGraph V,
N.edgeSet ⊆ M.edgeSet →
P M →
M.edgeSet = N.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).