Extract an unreachable pair from disconnectedness
ProvedWilliamsonShmoys.disconnected_pair_of_not_connected__p2m_d5850897_bb19_4a14_84a1_2d0f5ebfaf1b_a1approximation-algorithmsplanar-graphstreewidth
In a finite vertex type with at least three elements, a disconnected graph has two distinct vertices that are not connected by a path.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.disconnected_pair_of_not_connected__p2m_d5850897_bb19_4a14_84a1_2d0f5ebfaf1b_a1 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) (hV : 3 ≤ Fintype.card V) (hDisc : ¬ L.Connected) : ∃ u v : V, u ≠ v ∧ ¬ L.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).