Construct face counts and lengths from connected and planar edge bounds
ProvedWilliamsonShmoys.face_data_arithmetic_connected__p2m_58a549ee_4768_4664_9403_907071b96f48_a5approximation-algorithmsplanar-graphstreewidth
If n ≥ 3, connectedness supplies n ≤ m + 1, and the planar edge bound gives m ≤ 3n − 6; then a finite set of m + 2 − n faces can be assigned lengths at least three summing to 2m.
Preamble
import Mathlib set_option autoImplicit false open scoped BigOperators
Formal statement
theorem WilliamsonShmoys.face_data_arithmetic_connected__p2m_58a549ee_4768_4664_9403_907071b96f48_a5 (n m : Nat) (hn : 3 ≤ n) (hlow : n ≤ m + 1) (hupp : m ≤ 3 * n - 6) : ∃ (F : Type) (inst : Fintype F) (length : F → Nat), n + @Fintype.card F inst = m + 2 ∧ (∀ f : F, 3 ≤ length f) ∧ (letI : Fintype F := inst; (∑ f : F, length f) = 2 * m) := by sorry
Source
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).