Finite maximal drawable supergraph
ProvedWilliamsonShmoys.planar_edge_maximal_extension__p2m_e69220cf_5cc1_4342_a84f_9ccd3d593737_a7approximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite linearly ordered vertex type has a drawable supergraph on the same vertices that is maximal among drawable supergraphs containing it.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_maximal_extension__p2m_e69220cf_5cc1_4342_a84f_9ccd3d593737_a7
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K) :
exists L : SimpleGraph V,
K <= L /\ WilliamsonShmoys.HasPlanarDrawingOn L /\
(forall M : SimpleGraph V,
L <= M -> WilliamsonShmoys.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).