Count the edges of a maximal drawable graph
ProvedWilliamsonShmoys.edge_count_of_inclusion_maximal_planar_drawing_onapproximation-algorithmsplanar-graphstreewidth
An inclusion-maximal drawable simple graph on a finite ordered vertex type with at least three vertices has exactly 3|V|−6 edges. This removes the planar edge-count argument from the parent. A proof route is to show that maximality forces all faces to be triangles, then combine Euler’s formula with face-edge incidence counting. The hypothesis |V| ≥ 3 is preserved because the formula does not apply to maximal planar graphs on fewer vertices.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_of_inclusion_maximal_planar_drawing_on
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hmax : ∀ M : SimpleGraph V, L ≤ M → WilliamsonShmoys.HasPlanarDrawingOn M → M ≤ L) :
L.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).