Edge count is monotone under subgraphs
ProvedWilliamsonShmoys.edge_count_mono_of_subgraph_1794ae85approximation-algorithmsplanar-graphstreewidth
For finite graphs on the same vertex type, subgraph inclusion implies edge-count monotonicity. This transfers the connected supergraph’s bound back to the original graph.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.edge_count_mono_of_subgraph_1794ae85
{V : Type} [Fintype V]
(G H : SimpleGraph V)
(hGH : G ≤ H) :
G.edgeSet.ncard ≤ H.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).