Existence of an inclusion-maximal drawable supergraph
ProvedWilliamsonShmoys.maximal_planar_supergraph_exists_c4011bda_e2a2_4391_a47d_b4ea4febecd9approximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite vertex type has an inclusion-maximal drawable supergraph on that same type. This supplies the maximal extension used by the target.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_exists_c4011bda_e2a2_4391_a47d_b4ea4febecd9
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧ HasPlanarDrawingOn N ∧
∀ P : SimpleGraph V, N ≤ P → HasPlanarDrawingOn P → P = 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).