Component edge bounds
ProvedWilliamsonShmoys.component_edge_bounds__p2m_ddc73965_e52c_4f89_a584_0b5c76884424_a1approximation-algorithmsplanar-graphstreewidth
A component support of size at most two has at most one induced edge; for a support of size at least three, the local hypothesis gives the stated edge bound once its induced graph is shown connected.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.component_edge_bounds__p2m_ddc73965_e52c_4f89_a584_0b5c76884424_a1 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) (hLocal : ∀ (S : Finset V), 3 ≤ S.card → (L.induce (↑S : Set V)).Connected → (L.induce (↑S : Set V)).edgeSet.ncard + 6 ≤ 3 * S.card) : (∀ c : L.ConnectedComponent, c.supp.ncard ≤ 2 → (L.induce c.supp).edgeSet.ncard ≤ 1) ∧ (∀ c : L.ConnectedComponent, 3 ≤ c.supp.ncard → (L.induce c.supp).edgeSet.ncard + 6 ≤ 3 * c.supp.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).