Maximality forces the planar edge lower bound
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count_lower_bound_repair_8fa97b2bapproximation-algorithmsplanar-graphstreewidth
A graph with a planar drawing on at least three vertices that has no strictly larger planar supergraph on the same vertex set has at least 3|V| − 6 edges. The proof route extends it to a triangulation and uses maximality to rule out added edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count_lower_bound_repair_8fa97b2b
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hmax : ∀ N : SimpleGraph V, M.edgeSet ⊂ N.edgeSet →
¬ WilliamsonShmoys.HasPlanarDrawingOn N) :
3 * Fintype.card V - 6 ≤ M.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).