An edge across unreachable vertices strictly increases edge count
ProvedWilliamsonShmoys.local_extension_strict_edge_count__p2m_c1868ea9_2f79_4b93_ad6c_bc634ef3355f_a2approximation-algorithmsplanar-graphstreewidth
If H extends G by exactly the edge between u and v, and u and v were unreachable in G, then H has strictly more edges than G.
Preamble
import Mathlib
Formal statement
theorem WilliamsonShmoys.local_extension_strict_edge_count__p2m_c1868ea9_2f79_4b93_ad6c_bc634ef3355f_a2
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (u v : V) (huv : ¬ G.Reachable u v)
(H : SimpleGraph V) (hGH : G ≤ H)
(hadj : ∀ x y : V,
H.Adj x y ↔
G.Adj x y ∨ (x = u ∧ y = v) ∨ (x = v ∧ y = u)) :
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).