Existence of a maximal drawable supergraph
ProvedWilliamsonShmoys.exists_maximal_drawable_supergraph_e61f28a9_retry3Every drawable finite simple graph has a drawable supergraph on the same vertex type that is maximal among drawable supergraphs under graph inclusion. The finite proof chooses one with maximum edge-set cardinality.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn open WilliamsonShmoys set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.exists_maximal_drawable_supergraph_e61f28a9_retry3
{V : Type} [Fintype V] [LinearOrder V]
(T : SimpleGraph V) (hDraw : HasPlanarDrawingOn T) :
∃ U : SimpleGraph V, T ≤ U ∧ HasPlanarDrawingOn U ∧
∀ W : SimpleGraph V, U ≤ W → HasPlanarDrawingOn W → W = U := 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).