Aggregate graph edges over covering parts
ProvedWilliamsonShmoys.planar_component_edge_aggregation__p2m_98235c6f_660a_40d6_a6c4_218b22f2584f_a1approximation-algorithmsplanar-graphstreewidth
The total edge count is at most the sum of the induced edge counts over the parts. Assign each edge to a part containing both endpoints; disjointness ensures distinct parts cannot both contain its endpoints, and hadj supplies existence. A proof can express this assignment as an injection between finite edge sets and the corresponding disjoint union of local edge sets.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_component_edge_aggregation__p2m_98235c6f_660a_40d6_a6c4_218b22f2584f_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (parts : Finset (Finset V))
(hcover : ∀ v, ∃ C, C ∈ parts ∧ v ∈ C)
(hdisjoint : ∀ C, C ∈ parts → ∀ D, D ∈ parts → C ≠ D → Disjoint C D)
(hadj : ∀ u v, M.Adj u v → ∃ C, C ∈ parts ∧ u ∈ C ∧ v ∈ C) :
M.edgeSet.ncard ≤ ∑ C ∈ parts, (M.induce (C : Set V)).edgeSet.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).