Connect a finite planar drawing without losing edges
ProvedWilliamsonShmoys.extend_planar_drawing_connectedapproximation-algorithmsplanar-graphstreewidth
For a finite graph on at least three vertices, extend its crossing-free drawing to a connected crossing-free graph on the same vertices, without decreasing the edge count. This separates the disconnected-component issue from the Euler bound. A proof route is to join components one at a time by arcs in a common face of the current embedding, preserving the existing drawing and adding edges; finiteness ensures that the process terminates. The lower bound on the vertex count excludes the empty-vertex obstruction to connectedness.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.extend_planar_drawing_connected
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V)
(hV : 3 ≤ Fintype.card V)
(hdraw : WilliamsonShmoys.HasPlanarDrawingOn G) :
∃ H : SimpleGraph V,
G.edgeSet.ncard ≤ H.edgeSet.ncard ∧
H.Connected ∧
WilliamsonShmoys.HasPlanarDrawingOn H := 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).