A maximal planar drawing has the exact edge count
ProvedWilliamsonShmoys.maximal_drawing_edge_count_e9ce3df1_a197_4828_a24c_84c363604464approximation-algorithmsplanar-graphstreewidth
A maximal planar simple graph on a finite vertex type with at least three vertices has exactly three times the number of vertices minus six edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_drawing_edge_count_e9ce3df1_a197_4828_a24c_84c363604464
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hmax : ∀ M : SimpleGraph V, L ≤ M → WilliamsonShmoys.HasPlanarDrawingOn M → M = L) :
3 * Fintype.card V = L.edgeSet.ncard + 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).