Edge bound for small component supports
ProvedWilliamsonShmoys.component_edge_bounds_small__p2m_798c5648_bc79_4a8b_aaf2_40b61aa85372_a1approximation-algorithmsplanar-graphstreewidth
A simple graph induced on a connected-component support with at most two vertices has at most one edge.
Preamble
import Mathlib
Formal statement
theorem WilliamsonShmoys.component_edge_bounds_small__p2m_798c5648_bc79_4a8b_aaf2_40b61aa85372_a1 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) (c : L.ConnectedComponent) (hsmall : (SimpleGraph.ConnectedComponent.supp c).ncard ≤ 2) : (L.induce (SimpleGraph.ConnectedComponent.supp c)).edgeSet.ncard ≤ 1 := 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).