Edge count of a maximal drawable graph
ProvedWilliamsonShmoys.maximal_planar_graph_edge_count_0d153890approximation-algorithmsplanar-graphstreewidth
A drawable simple graph on at least three vertices that has no drawable strict supergraph on the same vertex type has exactly 3|V| − 6 edges. A proof shows maximality forces all faces to be triangles, then applies Euler’s formula; the lower bound on the number of vertices is retained.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_graph_edge_count_0d153890
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hmax : ∀ J : SimpleGraph V,
H ≤ J → WilliamsonShmoys.HasPlanarDrawingOn J → J = H) :
H.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).