Drawable graph augmentation to the planar edge lower bound
ProvedWilliamsonShmoys.drawable_supergraph_edge_count_lower_boundapproximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has a drawable supergraph on the same finite vertex type with at least 3|V|−6 edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_supergraph_edge_count_lower_bound
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hdraw : HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V) :
∃ P : SimpleGraph V, G ≤ P ∧ HasPlanarDrawingOn P ∧
3 * (Fintype.card V : Int) - 6 ≤ (P.edgeSet.ncard : Int) := 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).