A maximal drawable supergraph exists on a finite vertex type
ProvedWilliamsonShmoys.exists_maximal_planar_supergraph_for_edge_count_95ea5390approximation-algorithmsplanar-graphstreewidth
Among the finitely many drawable supergraphs of L on the fixed finite vertex type, choose one with maximum edge-set cardinality. It is inclusion-maximal among drawable supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_planar_supergraph_for_edge_count_95ea5390
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ M : SimpleGraph V,
L ≤ M ∧ WilliamsonShmoys.HasPlanarDrawingOn M ∧
∀ N : SimpleGraph V, M ≤ N →
WilliamsonShmoys.HasPlanarDrawingOn N → N = M := 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).