Existence of an inclusion-maximal drawable supergraph
ProvedWilliamsonShmoys.drawable_supergraph_maximal__p2m_1a5a4a98_d076_4be8_9c0b_d5fb8ab1d149_a1Every drawable finite graph has a drawable supergraph on the same vertices that is maximal under inclusion among drawable supergraphs.
Preamble
import Mathlib import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.drawable_supergraph_maximal__p2m_1a5a4a98_d076_4be8_9c0b_d5fb8ab1d149_a1
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V)
(hDraw : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ N : SimpleGraph V,
M ≤ N ∧ WilliamsonShmoys.HasPlanarDrawingOn N ∧
∀ P : SimpleGraph V,
N ≤ P → WilliamsonShmoys.HasPlanarDrawingOn P → P = N := 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).