Existence of an inclusion maximal drawable supergraph
ProvedWilliamsonShmoys.exists_inclusion_maximal_planar_supergraph__p2m_4b265a90_b8bd_4522_9040_b7d7632358e1_a1approximation-algorithmsplanar-graphstreewidth
Every finite drawable graph has a drawable supergraph on the same vertex type that is inclusion maximal among drawable supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open SimpleGraph
Formal statement
theorem WilliamsonShmoys.exists_inclusion_maximal_planar_supergraph__p2m_4b265a90_b8bd_4522_9040_b7d7632358e1_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ M : SimpleGraph V,
G ≤ M ∧ WilliamsonShmoys.HasPlanarDrawingOn M ∧
∀ N : SimpleGraph V, M ≤ N → WilliamsonShmoys.HasPlanarDrawingOn N → N ≤ M := 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).