Edge cardinality is monotone under subgraphs
ProvedWilliamsonShmoys.subgraph_edgeSet_ncard_le__p2m_ceffe8f7_0bd7_41ea_898f_3fe9bc8f26e2_a1For finite vertex types, the edge-set cardinality of a simple graph is at most that of any graph containing it as a subgraph.
Preamble
import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.subgraph_edgeSet_ncard_le__p2m_ceffe8f7_0bd7_41ea_898f_3fe9bc8f26e2_a1
{V : Type} [Fintype V]
(P Q : SimpleGraph V)
(hPQ : P ≤ Q) :
P.edgeSet.ncard ≤ Q.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).