Edge count of a maximal planar graph
ProvedWilliamsonShmoys.maximal_planar_edge_count_eqapproximation-algorithmsplanar-graphstreewidth
A simple graph on at least three finite vertices that has a crossing-free drawing and is maximal among graphs on those vertices with such a drawing has exactly 3|V|−6 edges, expressed without truncated subtraction as edge count plus six equals three times the number of vertices.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_edge_count_eq
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M)
(hmax : ∀ N : SimpleGraph V, M <= N → WilliamsonShmoys.HasPlanarDrawingOn N → N <= M) :
M.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).