Existence of an inclusion-maximal planar supergraph
ProvedWilliamsonShmoys.exists_maximal_planar_supergraph__p2m_92669c9b_dd39_4b0e_bff1_b3f1c8b950b1_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite graph has a drawable supergraph on the same vertices that is inclusion-maximal among drawable supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_supergraph__p2m_92669c9b_dd39_4b0e_bff1_b3f1c8b950b1_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
Set.Subset M.edgeSet N.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
∀ P : SimpleGraph V,
Set.Subset N.edgeSet P.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn P →
Set.Subset P.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).