Edge count of a maximal finite planar drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_exact_edge_count_v3approximation-algorithmsplanar-graphstreewidth
A drawable graph on at least three finite vertices that has no proper drawable supergraph on the same vertex type has exactly 3|V|−6 edges. Maximality forces a triangulation; Euler’s formula and triangular face boundaries give the count.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_exact_edge_count_v3
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hCard : 3 ≤ Fintype.card V)
(hMax : ∀ H' : SimpleGraph V,
H ≤ H' → WilliamsonShmoys.HasPlanarDrawingOn H' → H' = 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).