Maximal planar extension on the same vertex set
ProvedWilliamsonShmoys.planar_drawing_maximal_extension__p2m_b5de7163_4173_4d75_853e_5e2f32ae30ae_a1approximation-algorithmsplanar-graphstreewidth
Every drawn planar graph on at least three vertices is contained, on the same vertex set, in a planar graph maximal under adding edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_extension__p2m_b5de7163_4173_4d75_853e_5e2f32ae30ae_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hplanar : WilliamsonShmoys.HasPlanarDrawingOn K)
(hcard : 3 ≤ Fintype.card V) :
∃ H : SimpleGraph V,
K.edgeSet ⊆ H.edgeSet ∧
WilliamsonShmoys.HasPlanarDrawingOn H ∧
∀ J : SimpleGraph V, H.edgeSet ⊆ J.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn J → J.edgeSet = H.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).