Planar completion attaining the edge bound
ProvedWilliamsonShmoys.planar_completion_at_edge_boundapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on a finite linearly ordered vertex type with at least three vertices has a drawable supergraph on the same vertex type attaining the planar edge bound.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_completion_at_edge_bound
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V, M ≤ N ∧
WilliamsonShmoys.HasPlanarDrawingOn N ∧
N.edgeSet.ncard = 3 * Fintype.card V - 6 := 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).