Euler equation for a connected graph with a planar drawing
ProvedWilliamsonShmoys.connected_planar_euler__p2m_2343a1b4_cbe5_4a48_b836_711e4285cb1c_a1approximation-algorithmsplanar-graphstreewidth
For a finite connected graph with the supplied crossing-free drawing, there is a natural-number face count satisfying Euler’s equation: vertices plus faces equal edges plus two.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.connected_planar_euler__p2m_2343a1b4_cbe5_4a48_b836_711e4285cb1c_a1
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hplanar : HasPlanarDrawingOn H)
(hconnected : H.Connected) :
∃ f : ℕ, Fintype.card V + f = H.edgeSet.ncard + 2 := 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).