Finite planar completion to an inclusion-maximal drawing
ProvedWilliamsonShmoys.maximal_planar_supergraph__p2m_52c72b1a_727a_4125_917a_c27d4ca055ae_a1approximation-algorithmsplanar-graphstreewidth
Every drawable finite simple graph on at least three vertices has a drawable supergraph on the same vertex type that has no strictly larger drawable supergraph. This is the finite topological augmentation step; it does not assert an edge count.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph__p2m_52c72b1a_727a_4125_917a_c27d4ca055ae_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
∀ K : SimpleGraph V,
N ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = N := 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).