Euler face count and face incidence bound from a planar drawing
ProvedWilliamsonShmoys.planar_simple_graph_face_count_of_drawing__p2m_7f93d6a5_e061_4fd9_b77a_4e628bac87b4_a1approximation-algorithmsplanar-graphstreewidth
A connected simple graph with at least three vertices and the supplied crossing-free drawing has a finite face count satisfying Euler’s relation, with total face-boundary length at least three per face and total edge incidence twice the edge count.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_simple_graph_face_count_of_drawing__p2m_7f93d6a5_e061_4fd9_b77a_4e628bac87b4_a1
{V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) (hconn : H.Connected)
(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).