Non-reachability gives an edge-separated partition
ProvedWilliamsonShmoys.planar_bridge_partition__p2m_c25e31c2_3944_4e71_be02_9fbfc136a4b1_a1approximation-algorithmsplanar-graphstreewidth
If u and v are not reachable, the reachable set of u and its complement partition the vertices, separate u from v, and have no graph edge crossing between them.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_bridge_partition__p2m_c25e31c2_3944_4e71_be02_9fbfc136a4b1_a1
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) (u v : V) (hnot : ¬ G.Reachable u v) :
∃ A B : Set V,
(∀ x, x ∈ A ∨ x ∈ B) ∧
Disjoint A B ∧
u ∈ A ∧
v ∈ B ∧
(∀ x y, G.Adj x y → (x ∈ A ↔ y ∈ A)) := 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).