Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_card_2d69255633d74159approximation-algorithmsplanar-graphstreewidth
An inclusion-maximal simple planar graph on at least three vertices has exactly 3|V| − 6 edges. Maximality forces connectedness and triangular faces for a planar embedding; Euler’s formula and counting each edge on two face boundaries yield the result, including the three-vertex triangle case. This removes the planar-topology and counting obligation from the parent proof; formalizing those consequences for the supplied continuous-arc drawing predicate remains the core work.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_card_2d69255633d74159
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V) (hV : 3 ≤ Fintype.card V)
(hP : WilliamsonShmoys.HasPlanarDrawingOn P)
(hmax : ∀ Q : SimpleGraph V, P.edgeSet ⊆ Q.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn Q → Q.edgeSet ⊆ P.edgeSet) :
P.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).