Maximal planar graph edge lower bound
ProvedWilliamsonShmoys.maximal_planar_edge_lower_bound__p2m_b89122c2_2828_407e_ad92_2701689cab61_a1approximation-algorithmsplanar-graphstreewidth
If a finite simple graph with at least three vertices has a crossing-free drawing and admits no strictly larger planar simple supergraph on the same vertex set, its edge count is at least 3n−6.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_lower_bound__p2m_b89122c2_2828_407e_ad92_2701689cab61_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ K : SimpleGraph V,
H ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ H) :
3 * Fintype.card V ≤ H.edgeSet.ncard + 6 := 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).