Connected drawable supergraph for the planar edge bound
ProvedWilliamsonShmoys.drawable_connected_supergraph_for_edge_bound_3daf7e3aapproximation-algorithmsplanar-graphstreewidth
A drawable finite simple graph with at least three vertices has a connected drawable simple supergraph on the same vertices that contains every original edge.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_connected_supergraph_for_edge_bound_3daf7e3a
{V : Type} [Fintype V] [LinearOrder V]
(P : SimpleGraph V)
(hPdraw : WilliamsonShmoys.HasPlanarDrawingOn P)
(hCard : 3 ≤ Fintype.card V) :
∃ Q : SimpleGraph V, P ≤ Q ∧ Q.Connected ∧ WilliamsonShmoys.HasPlanarDrawingOn Q := 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).