Euler and face-incidence equations for a maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_face_equationsapproximation-algorithmsplanar-graphstreewidth
For a maximal drawable graph with at least three vertices, the number of faces satisfies Euler's equation, and every face is triangular, so counting incidences between faces and edges gives the second equation. Together these equations imply the edge count required by the target.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_face_equations
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hMax : ∀ M : SimpleGraph V, L ≤ M →
WilliamsonShmoys.HasPlanarDrawingOn M → M = L)
(hCard : 3 ≤ Fintype.card V) :
∃ f : ℕ,
Fintype.card V + f = L.edgeSet.ncard + 2 ∧
3 * f = 2 * L.edgeSet.ncard := 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).