Finite maximal planar supergraph extension
ProvedWilliamsonShmoys.planarDrawingOn_maximalExtension__p2m_7f93083e_ff7f_4b04_ad2d_f54588b36aea_a1approximation-algorithmsplanar-graphstreewidth
Every graph with a planar drawing on a finite vertex type has a planar drawn supergraph on the same vertices that is maximal under edge-set inclusion.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_maximalExtension__p2m_7f93083e_ff7f_4b04_ad2d_f54588b36aea_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N) :
∃ K : SimpleGraph V,
N.edgeSet ⊆ K.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
∀ L : SimpleGraph V,
K.edgeSet ⊆ L.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn L →
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).