Maximal drawable supergraph on a fixed vertex set
DisprovedWilliamsonShmoys.maximal_planar_supergraph__p2m_58d8e6f3_93b9_4006_85ea_c7e3275fd746_a4approximation-algorithmsplanar-graphstreewidth
Among the finitely many simple graphs on the same vertex type that contain L and admit a drawing, one has maximum edge count and is maximal among drawable supergraphs of L. Its edge count is at least that of L.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph__p2m_58d8e6f3_93b9_4006_85ea_c7e3275fd746_a4
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ M : SimpleGraph V,
L ≤ M ∧
WilliamsonShmoys.HasPlanarDrawingOn M ∧
(∀ N : SimpleGraph V, L ≤ N →
WilliamsonShmoys.HasPlanarDrawingOn N → N = M) ∧
L.edgeSet.ncard ≤ M.edgeSet.ncard := 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).