Maximal drawable graphs have the triangulation edge count
ProvedWilliamsonShmoys.triangulation_edge_count_of_maximal_drawableapproximation-algorithmsplanar-graphstreewidth
Every inclusion-maximal drawable simple graph on at least three vertices has exactly 3|V|−6 edges. This child contains the topological core: establish that maximality forces a triangulation, then count edges by Euler’s formula. For three vertices, maximality makes the graph K₃; for larger orders, the route is to show that a nontriangular face admits a drawable diagonal.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.triangulation_edge_count_of_maximal_drawable
{V : Type} [Fintype V] [LinearOrder V]
(U : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hU : WilliamsonShmoys.HasPlanarDrawingOn U)
(hmax : ∀ H : SimpleGraph V, U ≤ H →
WilliamsonShmoys.HasPlanarDrawingOn H → H ≤ U) :
U.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).