Euler and face-length data for a connected planar graph
ProvedWilliamsonShmoys.planar_connected_euler_data__p2m_5a9827f9_82f3_4b58_ad88_46e664a4abfc_a2approximation-algorithmsplanar-graphstreewidth
For a connected simple graph with at least three vertices and a crossing-free drawing, there is a natural face count satisfying Euler’s formula and the inequality that three times the face count is at most twice the edge count. The order and size hypotheses exclude the connected one-edge graph, whose sole face boundary would have length two.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_connected_euler_data__p2m_5a9827f9_82f3_4b58_ad88_46e664a4abfc_a2
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hM : HasPlanarDrawingOn M)
(hConnected : M.Connected)
(hCard : 3 ≤ Fintype.card V) :
∃ f : ℕ,
Fintype.card V + f = M.edgeSet.ncard + 2 ∧
3 * f ≤ 2 * M.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).