Existence of a maximal drawable supergraph
ProvedWilliamsonShmoys.planarDrawingOn_maximal_supergraph_fe74ac1b_216e_4ca8_b058_0b3c4a531007Every drawable finite simple graph has a drawable supergraph on the same vertices that is maximal under drawable supergraph inclusion.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_maximal_supergraph_fe74ac1b_216e_4ca8_b058_0b3c4a531007
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ K : SimpleGraph V,
G ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
∀ L : SimpleGraph V,
K ≤ L → WilliamsonShmoys.HasPlanarDrawingOn L → L = K := 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).