Euler face count and side bound for a crossing-free drawing
ProvedWilliamsonShmoys.planar_drawing_euler_face_count_e8dca3edapproximation-algorithmsplanar-graphstreewidth
A connected simple graph on at least three vertices with the specified crossing-free drawing has a finite face count satisfying Euler’s formula and the bound that at least three edge-sides occur per face.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_euler_face_count_e8dca3ed
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hConnected : G.Connected)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ f : ℕ,
Fintype.card V + f = G.edgeSet.ncard + 2 ∧
3 * f ≤ 2 * G.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).