Face equations for maximal planar drawings
ProvedWilliamsonShmoys.maximal_planar_face_decomposition__p2m_e85b752f_0f40_4cd5_9669_1350472cdb99_a1approximation-algorithmsplanar-graphstreewidth
A maximal planar drawing on at least three vertices has a face count that satisfies Euler’s equation and the triangular face-edge incidence equation.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.maximal_planar_face_decomposition__p2m_e85b752f_0f40_4cd5_9669_1350472cdb99_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hplanar : WilliamsonShmoys.HasPlanarDrawingOn H)
(hmax : ∀ K : SimpleGraph V, H ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K = H)
(hV : 3 ≤ Fintype.card V) :
∃ f : ℕ,
Fintype.card V + f = H.edgeSet.ncard + 2 ∧
3 * f = 2 * H.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).