Strict graph inclusion increases finite edge count
ProvedWilliamsonShmoys.edge_count_lt_of_ltapproximation-algorithmsplanar-graphstreewidth
If K is a strict subgraph of L on a finite vertex type, then K has strictly fewer edges.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.edge_count_lt_of_lt {V : Type} [Fintype V] [LinearOrder V] (K L : SimpleGraph V) (h : K < L) : Nat.card {e : Sym2 V // e ∈ K.edgeSet} < Nat.card {e : Sym2 V // e ∈ L.edgeSet} := 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).