Restrict a planar drawing to a subgraph
ProvedWilliamsonShmoys.planarDrawingOn_subgraph__p2m_fe6641dc_c570_459f_b36e_e7aed3590a75_a1approximation-algorithmsplanar-graphstreewidth
If one graph's edges are a subset of another's, any crossing-free drawing witness for the larger graph is also a drawing witness for the smaller graph.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planarDrawingOn_subgraph__p2m_fe6641dc_c570_459f_b36e_e7aed3590a75_a1
{V : Type} [Fintype V] [LinearOrder V]
{G H : SimpleGraph V}
(hGH : 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).