Finite family of drawable supergraphs
ProvedWilliamsonShmoys.finite_drawable_supergraphs__p2m_34323cd1_374d_4357_8256_7d86cba1e73f_a1approximation-algorithmsplanar-graphstreewidth
For a finite ordered vertex type, the set of drawable simple graphs containing a fixed graph is finite.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.finite_drawable_supergraphs__p2m_34323cd1_374d_4357_8256_7d86cba1e73f_a1 {V : Type} [Fintype V] [LinearOrder V] (L : SimpleGraph V) : ({T : SimpleGraph V | L ≤ T ∧ WilliamsonShmoys.HasPlanarDrawingOn T}).Finite := 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).