Maximal planar graphs have the Euler edge lower bound
ProvedWilliamsonShmoys.maximal_planar_graph_edge_lower_boundapproximation-algorithmsplanar-graphstreewidth
A planar graph on at least three vertices that has no strictly larger planar supergraph on the same vertex set has at least 3|V|−6 edges. The proof route is to derive the standard Euler bound for a maximal planar embedding: maximality forces faces to be triangular, after which Euler’s formula gives the edge count. This child removes the numerical edge bound from the parent; formalizing Euler’s formula and the consequence of maximality for the given drawing predicate remains the core obligation.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_lower_bound
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hN : WilliamsonShmoys.HasPlanarDrawingOn N)
(hmax : ∀ K : SimpleGraph V,
N.edgeSet ⊆ K.edgeSet →
WilliamsonShmoys.HasPlanarDrawingOn K →
K.edgeSet ⊆ N.edgeSet) :
3 * Fintype.card V - 6 ≤ N.edgeSet.ncard := 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).