A maximal drawable graph has the triangulation edge count
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count__p2m_0d90a4e2_211c_41d9_a3e6_1089ea8087c9_a1approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that is maximal under drawable supergraph inclusion has exactly three times the number of vertices minus six edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count__p2m_0d90a4e2_211c_41d9_a3e6_1089ea8087c9_a1
{V : Type} [Fintype V] [LinearOrder V] (K : SimpleGraph V)
(hV : 3 ≤ Fintype.card V) (hK : HasPlanarDrawingOn K)
(hmax : ∀ H : SimpleGraph V, K ≤ H → HasPlanarDrawingOn H → H ≤ K) :
3 * Fintype.card V = K.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).