A maximal drawable graph has the planar extremal edge count
ProvedWilliamsonShmoys.maximalPlanar_has_edge_countapproximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal among drawable supergraphs on the same vertex type has exactly 3|V|−6 edges. A proof route is to establish triangular faces from maximality and apply Euler’s formula; the lower bound on the vertex count is preserved.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximalPlanar_has_edge_count
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hCard : 3 ≤ Fintype.card V)
(hmax : ∀ K : SimpleGraph V, N.edgeSet ⊆ K.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn K → K = N) :
N.edgeSet.ncard = 3 * Fintype.card V - 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).