Planar edge-count upper bound

Proved

WilliamsonShmoys.maximal_planar_graph_edge_upper_bound__p2m_b64ef977_b4ef_4b2b_beae_4cc23cd005bf_a1

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

approximation-algorithmsplanar-graphstreewidth

A graph with the specified crossing-free drawing on at least three vertices has at most three times its vertex count minus six edges.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

set_option autoImplicit false

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.maximal_planar_graph_edge_upper_bound__p2m_b64ef977_b4ef_4b2b_beae_4cc23cd005bf_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (J : SimpleGraph V) (hcard : 3 ≤ Fintype.card V)
    (hplanar : HasPlanarDrawingOn J) :
    J.edgeSet.ncard + 6 ≤ 3 * Fintype.card V := 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