Augment a sparse planar drawing
ProvedWilliamsonShmoys.planar_edge_augmentation__p2m_c298a3e1_504a_4c1d_8a31_03ab929cfe86_a2If a drawable graph on at least three vertices has fewer than 3|V|−6 edges, it has a proper drawable supergraph on the same vertex set.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_augmentation__p2m_c298a3e1_504a_4c1d_8a31_03ab929cfe86_a2
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hCard : 3 ≤ Fintype.card V)
(hSparse : P.edgeSet.ncard < 3 * Fintype.card V - 6) :
∃ Q : SimpleGraph V,
P ≤ Q ∧ Q ≠ P ∧ WilliamsonShmoys.HasPlanarDrawingOn Q := 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).