Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Aggregate edge bounds over connected components

Proved
WilliamsonShmoys.planar_edge_count_upper_of_component_bounds__p2m_5598e679_4b8f_483d_bd76_05b90ab9d984_a3

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

approximation-algorithmsplanar-graphstreewidth

If each component of size at least three satisfies the connected edge bound, then the whole graph satisfies the bound. Sum component edge and vertex counts; use simplicity for components of size one or two, and use the whole-graph cardinality hypothesis to ensure total slack is at least six.

Preamble
import Mathlib
import Definitions.Def_WilliamsonShmoys_PlanarDrawingOn

set_option autoImplicit false

open WilliamsonShmoys
Formal statement
theorem WilliamsonShmoys.planar_edge_count_upper_of_component_bounds__p2m_5598e679_4b8f_483d_bd76_05b90ab9d984_a3
    {V : Type} [Fintype V] [LinearOrder V]
    (M : SimpleGraph V)
    (hCard : 3 ≤ Fintype.card V)
    (hLocal :
      ∀ c : M.ConnectedComponent, ∀ [Fintype c],
        3 ≤ Fintype.card c →
        (c.toSimpleGraph).edgeSet.ncard + 6 ≤ 3 * Fintype.card c) :
    M.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

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