An edge-maximal drawable graph meets the planar edge lower bound
ProvedWilliamsonShmoys.edge_lower_bound_of_no_planar_extension_on_fixed_verticesapproximation-algorithmsplanar-graphstreewidth
For at least three vertices, a drawable simple graph that has no strictly larger drawable supergraph on the same vertex set has at least 3|V|−6 edges. The independent proof route is to show maximality forces a connected triangulation, then apply Euler’s formula. The three-vertex boundary is included; without the lower-bound hypothesis, small maximal planar cases would need separate treatment.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_lower_bound_of_no_planar_extension_on_fixed_vertices
{V : Type} [Fintype V] [LinearOrder V]
(hV : 3 <= Fintype.card V)
(P : SimpleGraph V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P)
(hmax : ∀ Q : SimpleGraph V, P ≤ Q →
WilliamsonShmoys.HasPlanarDrawingOn Q → Q = P) :
3 * Fintype.card V - 6 ≤ P.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).