Edge count of a maximal drawable graph

Proved

WilliamsonShmoys.maximal_planar_edge_count__p2m_9ca2ebd3_f99a_4019_8342_a41927f598bc_a4

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

approximation-algorithmsplanar-graphstreewidth

A drawable finite simple graph on at least three vertices that is maximal under drawable edge extensions has exactly 3|V| − 6 edges.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib

open WilliamsonShmoys

Formal statement

theorem WilliamsonShmoys.maximal_planar_edge_count__p2m_9ca2ebd3_f99a_4019_8342_a41927f598bc_a4
    {V : Type} [Fintype V] [LinearOrder V]
    (K : SimpleGraph V) [DecidableRel K.Adj]
    (hK : HasPlanarDrawingOn K)
    (hmax : ∀ (L : SimpleGraph V) [DecidableRel L.Adj],
      HasPlanarDrawingOn L →
      K.edgeFinset ⊆ L.edgeFinset →
      K.edgeFinset = L.edgeFinset)
    (hV : 3 ≤ Fintype.card V) :
    K.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