Planar drawing passes to an edge subgraph
ProvedWilliamsonShmoys.hasPlanarDrawingOn_of_edgeSet_subset__p2m_90cbbd5c_48b8_4938_99ca_cd8db48989ee_a1approximation-algorithmsplanar-graphstreewidth
If H has a crossing-free drawing and G uses only edges of H, then G has a crossing-free drawing using the same vertex positions and arcs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.hasPlanarDrawingOn_of_edgeSet_subset__p2m_90cbbd5c_48b8_4938_99ca_cd8db48989ee_a1
{V : Type} [Fintype V] [LinearOrder V]
{G H : SimpleGraph V}
(hGH : Set.Subset G.edgeSet H.edgeSet)
(hH : WilliamsonShmoys.HasPlanarDrawingOn H) :
WilliamsonShmoys.HasPlanarDrawingOn G := 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).