Euler face count for a connected planar drawing
ProvedWilliamsonShmoys.planar_drawing_euler_face_count_afa305d5For a finite connected graph with a crossing-free drawing as defined by HasPlanarDrawingOn, the number of complementary faces satisfies Euler’s relation.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_euler_face_count_afa305d5
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn H)
(hConn : H.Connected) :
exists f : Nat, 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).