An inclusion-maximal planar graph has 3n minus 6 edges
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count__p2m_9c6e361c_4d55_4494_87be_52db2dff7ab6_a2approximation-algorithmsplanar-graphstreewidth
A finite simple graph on at least three vertices whose planar drawing admits no strict planar supergraph has exactly 3n − 6 edges. The independent proof route is to establish that maximality forces triangular faces, then combine Euler’s formula with the face-edge incidence count.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count__p2m_9c6e361c_4d55_4494_87be_52db2dff7ab6_a2
{V : Type} [Fintype V] [LinearOrder V]
(K : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hK : WilliamsonShmoys.HasPlanarDrawingOn K)
(hmax : forall L : SimpleGraph V,
(forall {u v}, K.Adj u v -> L.Adj u v) ->
WilliamsonShmoys.HasPlanarDrawingOn L -> L = K) :
K.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).