Edge count of an inclusion-maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_drawing_edge_count_fe58c870_e3e9_466f_b8e7_756f412ad0ccapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal graph on at least three vertices admitting the supplied crossing-free drawing has exactly 3|V|−6 edges. Maximality rules out bridges and nontriangular faces in a planar embedding; Euler’s formula then gives the count, with K₃ as the three-vertex boundary case.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_edge_count_fe58c870_e3e9_466f_b8e7_756f412ad0cc
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hmax : ∀ K : SimpleGraph V,
H ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = H) :
H.edgeSet.ncard = 3 * Fintype.card V - 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).