Completion of a drawable graph to a maximal planar edge count
ProvedWilliamsonShmoys.exists_planar_supergraph_with_edge_countapproximation-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 with exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.exists_planar_supergraph_with_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hDrawing : WilliamsonShmoys.HasPlanarDrawingOn L)
(hCard : 3 ≤ Fintype.card V) :
∃ M : SimpleGraph V, WilliamsonShmoys.HasPlanarDrawingOn M ∧
L.edgeSet ⊆ M.edgeSet ∧
M.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).