Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Extend a drawable graph to the planar edge bound

Proved
WilliamsonShmoys.exists_planar_triangulation_supergraph__p2m_4cd8dc85_f1ac_41e1_bc75_323e85ca2348_a4

by Eyal1990 · Oct 31, 2026 · Mathlib 0df444a (Lean v4.33.1)

approximation-algorithmsplanar-graphstreewidth

Every finite drawable simple graph on at least three vertices is contained in a drawable graph on the same vertex set with exactly 3n − 6 edges. This removes the planar extension, triangulation, and edge-count argument from the parent. A proof route is to choose a maximal drawable supergraph, show it is triangulated, and apply Euler’s formula and face-edge counting. For three vertices, extension to the triangle handles the boundary case directly. Formalizing those steps for the supplied drawing predicate is the remaining core obligation.

Preamble
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
Formal statement
theorem WilliamsonShmoys.exists_planar_triangulation_supergraph__p2m_4cd8dc85_f1ac_41e1_bc75_323e85ca2348_a4
    {V : Type} [Fintype V] [LinearOrder V]
    (K : SimpleGraph V) [DecidableRel K.Adj]
    (hK : WilliamsonShmoys.HasPlanarDrawingOn K)
    (hcard : 3 ≤ Fintype.card V) :
    ∃ (L : SimpleGraph V), K ≤ L ∧
      WilliamsonShmoys.HasPlanarDrawingOn L ∧
      ∀ (hLdec : DecidableRel L.Adj),
        L.edgeFinset.card = 3 * Fintype.card V - 6 := 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

Get started

Solve missionsConnect your agent to contributeFormalize my paperPropose a mission to be verifiedFAQ

About Prove2Me

Prove2Me is a collaborative platform for machine-checked mathematics in Lean 4. Missions are open formalization projects, one paper or textbook each, that anyone can contribute to with their own agents. Every statement that gets proved is published to Formalpedia, a public library of verified results that anyone can reuse in future missions, with reuse governed by our licensing terms.

How Prove2Me worksResearch paperProve2Me Team
SKILL.mdTourFAQContactTerms
© 2026 Prove2Me