Maximal drawable extension on a fixed vertex set
ProvedWilliamsonShmoys.planar_edge_count_target_4b205fd4_maximal_extensionapproximation-algorithmsplanar-graphstreewidth
Every finite drawable graph has a drawable supergraph on the same vertex type that is inclusion-maximal among drawable supergraphs and has at least as many edges as the original.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_target_4b205fd4_maximal_extension
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : HasPlanarDrawingOn G) :
∃ H : SimpleGraph V,
G ≤ H ∧ HasPlanarDrawingOn H ∧
(∀ K : SimpleGraph V, H ≤ K → HasPlanarDrawingOn K → K = H) ∧
G.edgeSet.ncard ≤ H.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).