Drawable planar completion with maximal edge count
ProvedWilliamsonShmoys.planar_drawing_completion_edge_count_aca21fa1_3086c322_8519_4d73_8f33_f085f9c7277bapproximation-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 vertices with exactly 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_completion_edge_count_aca21fa1_3086c322_8519_4d73_8f33_f085f9c7277b
{V : Type} [Fintype V] [LinearOrder V]
(Z : SimpleGraph V)
(hZ : HasPlanarDrawingOn Z)
(hCard : 3 <= Fintype.card V) :
∃ W : SimpleGraph V,
HasPlanarDrawingOn W ∧
(∀ u v, Z.Adj u v → W.Adj u v) ∧
(W.edgeSet.ncard : Int) = 3 * (Fintype.card V : Int) - 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).