Planar graphs admit an edge-rich drawable supergraph
ProvedWilliamsonShmoys.planar_edge_augmentation_lower_bound__p2m_99986598_6392_4501_ac0d_a0cd3c835fd3_a1approximation-algorithmsplanar-graphstreewidth
Every drawable simple graph on at least three vertices has a drawable supergraph on the same vertex type with at least 3n−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_augmentation_lower_bound__p2m_99986598_6392_4501_ac0d_a0cd3c835fd3_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V) (hcard : 3 ≤ Fintype.card V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
∃ K : SimpleGraph V, L ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
3 * Fintype.card V - 6 ≤ K.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).