Edge count is monotone under graph inclusion
ProvedWilliamsonShmoys.edgeSet_ncard_mono_repair_20261028This child removes the finite-cardinality transfer from the parent. It is a new elementary graph argument: inclusion gives inclusion of edge sets, and cardinality is monotone for finite sets. It is independent of the drawing hypotheses.
Preamble
import Mathlib
Formal statement
theorem WilliamsonShmoys.edgeSet_ncard_mono_repair_20261028
{V : Type} [Fintype V]
(H K : SimpleGraph V)
(hHK : H ≤ K) :
H.edgeSet.ncard ≤ K.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).