Euler upper bound for finite simple planar graphs

Proved

WilliamsonShmoys_maximal_planar_graph_edge_count_upper_bound__p2m_f302bffe_a312_4c80_ba34_5d3904b8242e_a1

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

approximation-algorithmsplanar-graphstreewidth

Every finite simple graph with a crossing-free drawing and at least three vertices has at most 3n−6 edges. This removes the upper-counting half of the target; prove it by deriving Euler's formula for the drawing and handling face-boundary incidences, including bridges and disconnected graphs.

Preamble

import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn
import Mathlib
set_option autoImplicit false

Formal statement

theorem WilliamsonShmoys_maximal_planar_graph_edge_count_upper_bound__p2m_f302bffe_a312_4c80_ba34_5d3904b8242e_a1
    {V : Type} [Fintype V] [LinearOrder V]
    (L : SimpleGraph V) (hcard : 3 ≤ Fintype.card V)
    (hL : WilliamsonShmoys.HasPlanarDrawingOn L) :
    L.edgeSet.ncard ≤ 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