An inclusion-maximal planar drawing has the exact edge count
ProvedWilliamsonShmoys.maximal_planar_supergraph_edge_count__p2m_52c72b1a_727a_4125_917a_c27d4ca055ae_a1approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph has exactly 3|V|−6 edges. The proof route is to show maximality forces every face to be triangular and then count face-edge incidences using Euler’s formula, treating the three-vertex boundary case explicitly.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_supergraph_edge_count__p2m_52c72b1a_727a_4125_917a_c27d4ca055ae_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hCard : 3 ≤ Fintype.card V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn N)
(hMaximal : ∀ K : SimpleGraph V,
N ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = N) :
N.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).