Uniform slack for each connected part
ProvedWilliamsonShmoys.component_bounds_sum_component_slack__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1approximation-algorithmsplanar-graphstreewidth
Every nonempty connected part has at least three units of slack: its induced edge count plus three is at most three times its vertex count. For parts of size one or two this follows from simplicity; larger parts use the supplied local bound.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.component_bounds_sum_component_slack__p2m_1720d2b2_bbea_4d47_affc_65940ff7c983_a1
{V : Type} [Fintype V] [LinearOrder V]
(N : SimpleGraph V) (dN : DecidableRel N.Adj)
(C : Finset (Finset V))
(hnonempty : ∀ s ∈ C, s.Nonempty)
(hconnected : ∀ s ∈ C, (N.induce (s : Set V)).Connected)
(hlocal : ∀ s : Finset V, 3 <= s.card ->
(N.induce (s : Set V)).Connected ->
(N.induce (s : Set V)).edgeFinset.card <= 3 * s.card - 6) :
∀ s ∈ C, (N.induce (s : Set V)).edgeFinset.card + 3 <= 3 * s.card := 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).