Finiteness of planar drawing candidates
ProvedWilliamsonShmoys.planar_drawing_on_maximal_extension_repair2_finite_candidatesapproximation-algorithmsplanar-graphstreewidth
For a finite vertex type, the set of drawable simple graphs containing a fixed graph is finite.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_drawing_on_maximal_extension_repair2_finite_candidates
{V : Type} [Fintype V] [LinearOrder V]
(G : SimpleGraph V) :
Set.Finite {M : SimpleGraph V | G ≤ M ∧ WilliamsonShmoys.HasPlanarDrawingOn M} := 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).