Proper graph inclusion increases finite edge count
ProvedWilliamsonShmoys.edge_card_lt_of_le_not_le__p2m_22ec19d4_3db6_4330_9c26_3c973d11bb33_a1approximation-algorithmsplanar-graphstreewidth
For finite simple graphs, if L is a subgraph of H and H is not a subgraph of L, then L has strictly fewer edges. This follows by viewing edgeFinset L as a proper subset of edgeFinset H.
Preamble
import Mathlib
Formal statement
theorem WilliamsonShmoys.edge_card_lt_of_le_not_le__p2m_22ec19d4_3db6_4330_9c26_3c973d11bb33_a1
{V : Type} [Fintype V] [LinearOrder V]
(L H : SimpleGraph V) [DecidableRel L.Adj] [DecidableRel H.Adj]
(hLH : L ≤ H) (hnot : ¬ H ≤ L) :
L.edgeFinset.card < H.edgeFinset.card := 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).