Euler formula for a connected planar drawing
ProvedWilliamsonShmoys.planarDrawing_euler_formula__p2m_7e15a8d6_7041_4a6f_b660_410e45ab60c6_a1approximation-algorithmsplanar-graphstreewidth
For a finite connected simple graph with a crossing-free drawing, there is a natural number of faces satisfying Euler’s formula, with vertices plus faces equal to edges plus two. The drawing supplies the embedding; connectedness is needed for the stated Euler formula.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planarDrawing_euler_formula__p2m_7e15a8d6_7041_4a6f_b660_410e45ab60c6_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (dG : DecidableRel G.Adj)
(hconn : G.Connected)
(hG : HasPlanarDrawingOn G) :
∃ f : ℕ,
Fintype.card V + f = (letI : DecidableRel G.Adj := dG; G.edgeFinset.card) + 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).