Every added edge of a minimal connected extension is critical
ProvedWilliamsonShmoys.added_edge_critical_of_minimal_extension__p2m_af495ada_8c1f_484d_a693_c45034ff536b_a2approximation-algorithmsplanar-graphstreewidth
For a connected extension minimal under inclusion, deleting any edge outside M disconnects its endpoints. An alternate route would preserve connectedness and M after deletion, contradicting minimality.
Preamble
import Mathlib set_option autoImplicit false open SimpleGraph
Formal statement
theorem WilliamsonShmoys.added_edge_critical_of_minimal_extension__p2m_af495ada_8c1f_484d_a693_c45034ff536b_a2
{V : Type} [Fintype V] [LinearOrder V]
(M H : SimpleGraph V)
(hMH : M ≤ H) (hconn : H.Connected)
(hmin : ∀ K : SimpleGraph V, M ≤ K → K ≤ H → K.Connected → K = H) :
∀ u v : V, H.Adj u v → ¬ M.Adj u v →
¬ (H.deleteEdges {s(u, v)}).Reachable u v := 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).