An edge-maximal planar graph has 3n minus 6 edges
ProvedWilliamsonShmoys.maximal_planar_edge_count_from_drawing_cd0a3fa1approximation-algorithmsplanar-graphstreewidth
A planar simple graph on at least three vertices that admits no proper planar supergraph on the same vertex set has exactly 3n − 6 edges. The boundary n = 3 is included. The independent proof route is to obtain a plane embedding from the supplied arc drawing, derive triangular face boundaries from maximality, then count face-edge incidences and apply Euler’s formula. This is the remaining core topological obligation.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_from_drawing_cd0a3fa1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : WilliamsonShmoys.HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ K : SimpleGraph V,
(∀ ⦃u v : V⦄, G.Adj u v → K.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn K →
(∀ ⦃u v : V⦄, K.Adj u v → G.Adj u v)) :
G.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).