A subgraph of a drawable graph is drawable
ProvedWilliamsonShmoys.planar_drawing_mono__p2m_73c85c29_4333_4692_baee_7210fe30cead_a1approximation-algorithmsplanar-graphstreewidth
If G is a subgraph of H and H has a planar drawing under the target's definition, then G has a planar drawing.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open SimpleGraph
Formal statement
theorem WilliamsonShmoys.planar_drawing_mono__p2m_73c85c29_4333_4692_baee_7210fe30cead_a1
{V : Type} [Fintype V] [LinearOrder V]
{G H : SimpleGraph V}
(hGH : G ≤ H)
(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).