Drawable supergraph edge lower bound
ProvedWilliamsonShmoys.planar_supergraph_edge_lower_bound__p2m_85ec4d12_af4e_4e6b_adb3_c8b105f3133d_a1approximation-algorithmsplanar-graphstreewidth
Any drawable finite simple graph on at least three vertices has a drawable supergraph on the same vertex set with at least 3n - 6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_supergraph_edge_lower_bound__p2m_85ec4d12_af4e_4e6b_adb3_c8b105f3133d_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) [DecidableRel G.Adj]
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hcard : 3 ≤ Fintype.card V) :
∃ K : SimpleGraph V,
G ≤ K ∧
WilliamsonShmoys.HasPlanarDrawingOn K ∧
(∀ [DecidableRel K.Adj],
3 * Fintype.card V - 6 ≤ K.edgeFinset.card) := 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).