Connect a drawable graph with at least three vertices
ProvedWilliamsonShmoys.planar_drawing_connected_extension_with_three_vertices__p2m_425c8e2e_b612_4bb5_a030_cd4c3c162389_a2approximation-algorithmsplanar-graphstreewidth
A drawable finite simple graph on at least three vertices has a connected drawable supergraph on the same vertices that retains every original edge.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_connected_extension_with_three_vertices__p2m_425c8e2e_b612_4bb5_a030_cd4c3c162389_a2 {V : Type} [Fintype V] [LinearOrder V] (H : SimpleGraph V) (hDraw : WilliamsonShmoys.HasPlanarDrawingOn H) (hV : 3 ≤ Fintype.card V) : ∃ K : SimpleGraph V, H.edgeSet ⊆ K.edgeSet ∧ K.Connected ∧ WilliamsonShmoys.HasPlanarDrawingOn K := 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).