Existence of a maximal planar supergraph on the same vertices
ProvedWilliamsonShmoys.maximal_planar_extension_exists__p2m_d1313f94_0954_4f2e_9b9e_c37a9ebd0ec4_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite graph on the given vertex type is contained in a drawable graph on the same vertices that has no strictly larger drawable supergraph.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_extension_exists__p2m_d1313f94_0954_4f2e_9b9e_c37a9ebd0ec4_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hCard : 3 ≤ Fintype.card V) :
∃ M : SimpleGraph V,
Set.Subset L.edgeSet M.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn M ∧
(∀ N : SimpleGraph V,
Set.Subset M.edgeSet N.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn N →
Set.Subset N.edgeSet M.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).