A maximal drawable graph has the triangulation edge count
ProvedWilliamsonShmoys.maximal_planar_graph_exact_edge_countapproximation-algorithmsplanar-graphstreewidth
For at least three vertices, an inclusion-maximal graph admitting the given crossing-free drawing has exactly 3|V|−6 edges. The lower bound on the vertex count is needed for the triangulation formula, including its small cases.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_exact_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(J : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hJ : WilliamsonShmoys.HasPlanarDrawingOn J)
(hmax : ∀ K : SimpleGraph V,
J ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = J) :
J.edgeSet.ncard + 6 = 3 * Fintype.card V := 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).