A sparse planar drawing admits a strict planar edge extension
ProvedWilliamsonShmoys.planar_edge_augmentation_of_small_card__p2m_6f7b33c7_a7c9_44db_bbb3_dcbcd538e90d_a1approximation-algorithmsplanar-graphstreewidth
For a finite linearly ordered vertex type of size at least three, any graph with a crossing-free drawing and fewer than 3|V|−6 edges has a crossing-free supergraph on the same vertices with strictly more edges. The parent applies this to U and contradicts edge maximality.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_edge_augmentation_of_small_card__p2m_6f7b33c7_a7c9_44db_bbb3_dcbcd538e90d_a1
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V) (dU : DecidableRel U.Adj)
(hU : HasPlanarDrawingOn U)
(hcard : 3 ≤ Fintype.card V)
(hsmall : (letI : DecidableRel U.Adj := dU
U.edgeFinset.card + 6 < 3 * Fintype.card V)) :
∃ (W : SimpleGraph V) (dW : DecidableRel W.Adj),
HasPlanarDrawingOn W ∧
(letI : DecidableRel U.Adj := dU
letI : DecidableRel W.Adj := dW
U.edgeFinset ⊆ W.edgeFinset) ∧
¬ (letI : DecidableRel U.Adj := dU
letI : DecidableRel W.Adj := dW
W.edgeFinset ⊆ U.edgeFinset) := 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).