Drawable supergraph with maximum edge count
ProvedWilliamsonShmoys.exists_drawable_supergraph_max_edgesapproximation-algorithmsplanar-graphstreewidth
For a drawable graph on a finite linearly ordered vertex type, some drawable supergraph containing it has at least as many edges as every other drawable supergraph containing it.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_drawable_supergraph_max_edges
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V)
(hT : WilliamsonShmoys.HasPlanarDrawingOn T) :
∃ M : SimpleGraph V,
T ≤ M ∧ WilliamsonShmoys.HasPlanarDrawingOn M ∧
∀ N : SimpleGraph V, T ≤ N → WilliamsonShmoys.HasPlanarDrawingOn N →
N.edgeSet.ncard ≤ M.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).