A finite maximal drawable supergraph exists
ProvedWilliamsonShmoys.planar_drawing_maximal_supergraph__p2m_97829890_428d_4657_a899_f7e200a68a7c_a4approximation-algorithmsplanar-graphstreewidth
Among the drawable supergraphs of a finite graph on the same ordered vertex type, one is maximal under graph inclusion. This removes the finite selection step from the parent proof; maximize edge count over all drawable supergraphs.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_supergraph__p2m_97829890_428d_4657_a899_f7e200a68a7c_a4
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : HasPlanarDrawingOn H) :
∃ K : SimpleGraph V,
H ≤ K ∧ HasPlanarDrawingOn K ∧
∀ L : SimpleGraph V, K ≤ L → 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).