An edge-maximal planar graph has the triangulation edge bound
ProvedWilliamsonShmoys.maximal_planar_graph_edge_boundapproximation-algorithmsplanar-graphstreewidth
If a planar graph on at least three vertices has maximum edge count among its planar supergraphs on the same vertices, then it has at least 3n−6 edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_bound
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ H : SimpleGraph V,
(∀ ⦃u v : V⦄, K.Adj u v → H.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn H →
H.edgeSet.ncard ≤ K.edgeSet.ncard) :
3 * Fintype.card V - 6 ≤ K.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).