A subgraph inherits a crossing-free drawing
ProvedWilliamsonShmoys.planar_drawing_subgraph__p2m_10e5fa50_ae85_4d68_b666_509a03938328_a1approximation-algorithmsplanar-graphstreewidth
If a graph has a crossing-free drawing and another graph on the same ordered vertex type is its subgraph, then that subgraph has a crossing-free drawing.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_subgraph__p2m_10e5fa50_ae85_4d68_b666_509a03938328_a1 {V : Type} [Fintype V] [LinearOrder V] (G H : SimpleGraph V) (hH : HasPlanarDrawingOn H) (hGH : G ≤ H) : 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).