A subgraph of a drawable graph is drawable

Proved

WilliamsonShmoys.planar_drawing_subgraph__p2m_918f6ef7_b742_4a7a_b6c7_f41fd05476c6_a1

by Eyal1990 · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

Removing edges from a graph with a planar drawing preserves the drawing on the same ordered vertex type.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.planar_drawing_subgraph__p2m_918f6ef7_b742_4a7a_b6c7_f41fd05476c6_a1
    {V : Type} [Fintype V] [LinearOrder V]
    {G H : SimpleGraph V} (hHG : H ≤ G) (hG : HasPlanarDrawingOn G) :
    HasPlanarDrawingOn H := by sorry

Source

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).

View graph