Euler count and face-boundary lengths from a planar drawing
ProvedWilliamsonShmoys.connected_planar_face_boundary_decomposition__p2m_189aab1a_280b_4ab3_961b_1c0b2454cb23_a1approximation-algorithmsplanar-graphstreewidth
For a finite connected simple graph with at least three vertices and a crossing-free drawing, the face boundary walks can be listed so their number satisfies Euler’s formula, their lengths sum to twice the number of edges, and every boundary walk has length at least three. This packages the needed planar topology and the exclusion of one- and two-edge face boundaries under the stated hypotheses.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Connectivity.Connected import Mathlib set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.connected_planar_face_boundary_decomposition__p2m_189aab1a_280b_4ab3_961b_1c0b2454cb23_a1 {V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hG : HasPlanarDrawingOn G)
(hV : 3 ≤ Fintype.card V)
(hconn : G.Connected) :
∃ f : ℕ, ∃ lengths : List ℕ,
f + Fintype.card V = G.edgeSet.ncard + 2 ∧
lengths.length = f ∧
lengths.sum = 2 * G.edgeSet.ncard ∧
∀ x ∈ lengths, 3 ≤ x := 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).