Finite maximal drawable supergraph extension
ProvedWilliamsonShmoys.drawable_graph_maximal_extension__p2m_c603be23_9a74_4dd9_9858_66dd86a4b903_a1approximation-algorithmsplanar-graphstreewidth
Any drawable finite simple graph has a drawable supergraph on the same vertex set that is inclusion-maximal among drawable supergraphs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_graph_maximal_extension__p2m_c603be23_9a74_4dd9_9858_66dd86a4b903_a1
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V) (hK : HasPlanarDrawingOn K) :
∃ L : SimpleGraph V,
K ≤ L ∧ HasPlanarDrawingOn L ∧
∀ M : SimpleGraph V, L ≤ M → HasPlanarDrawingOn M → M = L := 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).