Face accounting implies the planar edge bound
ProvedWilliamsonShmoys.face_accounting_implies_edge_boundFor a finite graph, Euler’s equation together with two boundary incidences per edge and at least three incidences per face implies the 3V−6 edge bound.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.face_accounting_implies_edge_bound
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hData : ∃ (f b : Nat),
Fintype.card V + f = G.edgeSet.ncard + 2 ∧
2 * G.edgeSet.ncard = b ∧
3 * f ≤ b) :
G.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).