Euler and triangular-face equations for a maximal planar drawing
ProvedWilliamsonShmoys.maximal_planar_face_equations_570807d1_034b_400e_a623_bb3aff438dd2approximation-algorithmsplanar-graphstreewidth
For a finite drawable graph on at least three vertices that is maximal among drawable supergraphs on the same vertex type, there is a face count satisfying Euler’s equation and the triangular-face incidence equation. These equations imply the target edge count. The lower bound includes the three-vertex boundary case.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_face_equations_570807d1_034b_400e_a623_bb3aff438dd2
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(hL : WilliamsonShmoys.HasPlanarDrawingOn L)
(hMax : ∀ M : SimpleGraph V, L.edgeSet ⊆ M.edgeSet →
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).