An edge-count-maximal planar graph has 3n − 6 edges
ProvedWilliamsonShmoys.edge_count_of_edge_maximal_planarapproximation-algorithmsplanar-graphstreewidth
A finite simple graph with at least three vertices whose planar drawing cannot be extended by adding edges has exactly 3|V| − 6 edges. A proof can establish connectedness and triangular faces for an edge-maximal planar embedding, then use Euler’s formula and face-edge incidence counting.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_of_edge_maximal_planar
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hV : 3 ≤ Fintype.card V)
(hmax : ∀ N : SimpleGraph V,
M ≤ N → WilliamsonShmoys.HasPlanarDrawingOn N →
N.edgeSet.ncard ≤ M.edgeSet.ncard) :
M.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).