Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

An edge-maximal drawable graph has the triangulation edge count

Proved
WilliamsonShmoys.maximal_planar_drawing_has_euler_edge_count_38271ead_fcb7_486e_b3a1_3bd65c5883ef

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

approximation-algorithmsplanar-graphstreewidth

A drawable simple graph on at least three vertices that has no strictly larger drawable supergraph has exactly 3|V|−6 edges. This removes the geometric triangulation and counting work from the parent. The lower bound is essential to the edge formula. A proof derives a planar embedding from the drawing, uses maximality to show every face is triangular, and applies Euler’s formula; for three vertices the maximal graph is the triangle.

Preamble
import Mathlib
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn

set_option autoImplicit false
Formal statement
theorem WilliamsonShmoys.maximal_planar_drawing_has_euler_edge_count_38271ead_fcb7_486e_b3a1_3bd65c5883ef
    {V : Type} [Fintype V] [LinearOrder V]
    (M : SimpleGraph V)
    (hM : WilliamsonShmoys.HasPlanarDrawingOn M)
    (hCard : 3 ≤ Fintype.card V)
    (hMax : ∀ K : SimpleGraph V,
      M ≤ K → WilliamsonShmoys.HasPlanarDrawingOn K → K ≤ M) :
    (M.edgeSet.ncard : Int) = 3 * (Fintype.card V : Int) - 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