A changed reachability relation forces different edge sets
ProvedFiniteGraph.edgeSet_ne_of_new_reachableapproximation-algorithmsplanar-graphstreewidth
If a pair of vertices is unreachable in one simple graph and reachable in another, their edge sets differ.
Preamble
import Mathlib
Formal statement
theorem FiniteGraph.edgeSet_ne_of_new_reachable
{V : Type} [Fintype V]
(F H : SimpleGraph V)
(hnew : ∃ u v : V, ¬ F.Reachable u v ∧ H.Reachable u v) :
H.edgeSet ≠ F.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).