Maximal planar extension on the same vertices
ProvedWilliamsonShmoys.planar_drawing_maximal_extension_05250361_edf9_4bba_b0bb_f1c9e6abc2aa__p2m_8b7a9859_39fc_4bba_ad5e_209d86284fdb_a5approximation-algorithmsplanar-graphstreewidth
Every drawable graph on a finite vertex type has a drawable supergraph maximal under edge inclusion. The finite collection of graphs on V and the original drawing provide a maximum-cardinality choice.
Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn import Mathlib.Combinatorics.SimpleGraph.Basic set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.planar_drawing_maximal_extension_05250361_edf9_4bba_b0bb_f1c9e6abc2aa__p2m_8b7a9859_39fc_4bba_ad5e_209d86284fdb_a5
{V : Type} [Fintype V] [LinearOrder V]
(M : SimpleGraph V) (hV : 3 <= Fintype.card V)
(hM : WilliamsonShmoys.HasPlanarDrawingOn M) :
∃ Q : SimpleGraph V,
(∀ {u v : V}, M.Adj u v → Q.Adj u v) ∧
WilliamsonShmoys.HasPlanarDrawingOn Q ∧
(∀ R : SimpleGraph V,
(∀ {u v : V}, Q.Adj u v → R.Adj u v) →
WilliamsonShmoys.HasPlanarDrawingOn R → R = Q) := 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).