Finite maximal drawable extension

Proved

WilliamsonShmoys.planar_drawing_maximal_extension__p2m_db2bc25d_3c02_46be_91b6_cd4d6f11e2cd_a1

by Eyal1990 · Nov 1, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

Every drawable graph on a finite ordered vertex type has a drawable supergraph on the same vertices that is maximal under inclusion among drawable supergraphs. The statement also applies when the vertex count is exactly three.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

set_option autoImplicit false
open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.planar_drawing_maximal_extension__p2m_db2bc25d_3c02_46be_91b6_cd4d6f11e2cd_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (G : SimpleGraph V) (hG : HasPlanarDrawingOn G) :
    ∃ R : SimpleGraph V, G ≤ R ∧ HasPlanarDrawingOn R ∧
      ∀ H : SimpleGraph V, R ≤ H → HasPlanarDrawingOn H → H = R := by sorry

Source

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).

View graph