A disconnected drawing admits a proper drawable extension
ProvedWilliamsonShmoys.disconnected_drawing_proper_extension_connectedification_retry3A disconnected graph with a crossing-free drawing on at least three vertices has a proper drawable supergraph on the same vertices.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.disconnected_drawing_proper_extension_connectedification_retry3
{V : Type} [Fintype V] [LinearOrder V]
(H : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn H)
(hCard : 3 ≤ Fintype.card V)
(hNotConnected : ¬ H.Connected) :
∃ K : SimpleGraph V,
H ≤ K ∧
K ≠ H ∧
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).