Face count of a maximal planar triangular map
ProvedWilliamsonShmoys.maximal_planar_map_face_countapproximation-algorithmsplanar-graphstreewidth
For a drawing-maximal simple planar graph with at least three vertices, any triangular map on Fin m has m = 2|V| − 4. The intended route is Euler’s formula for the spherical embedding, maximality’s planar edge count, and double-counting the map’s darts (three per face, two per edge). The map structure alone does not imply planarity, so the drawing and maximality hypotheses remain necessary.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarIndependentSetRAM import Definitions.Def_WilliamsonShmoys_TriangularMap import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_map_face_count
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H)
(hV : 3 ≤ Fintype.card V)
(hMax : ∀ K : SimpleGraph V, H ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ H)
(m : Nat)
(M : WilliamsonShmoys.TriangularMap H (Fin m)) :
2 * Fintype.card V = m + 4 := 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).