Edge accounting for a partition with no crossing edges
ProvedWilliamsonShmoys.partition_edge_accounting__p2m_8191f462_9581_40b2_8ed6_f73b850717b9_a1approximation-algorithmsplanar-graphstreewidth
For a finite graph, a disjoint vertex partition covering all vertices counts every edge exactly once in the induced subgraphs when every edge has both endpoints in one part. Prove this by identifying each induced edge with its original edge, then using disjointness and edge locality to show these edge sets partition the original edge set. Empty graphs and isolated vertices contribute zero edges.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open Finset
Formal statement
theorem WilliamsonShmoys.partition_edge_accounting__p2m_8191f462_9581_40b2_8ed6_f73b850717b9_a1
{V : Type} [Fintype V] [LinearOrder V]
(L : SimpleGraph V)
(C : V → Finset V)
(hdisjoint : ∀ i j, i ≠ j → Disjoint (C i) (C j))
(hcover : Finset.univ.biUnion C = Finset.univ)
(hlocal : ∀ u v, L.Adj u v → ∃ i, u ∈ C i ∧ v ∈ C i) :
L.edgeSet.ncard = ∑ i : V, (L.induce (fun v => v ∈ C i)).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).