Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, pp. 794–795 — on a 3-regular c-expander the uniform max-flow is f ≤ 6𝒮/(c(⌊log n⌋ − 2))

Proved
LeightonRao.BadExample.flow_le_of_expander

by mikedeng1 · Oct 6, 2026 · Mathlib 0df444a (Lean v4.33.1)

expander-graphmax-flow-min-cutmulticommodity-flowp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1sparsest-cut

Let GGG be a 3-regular graph on n≥8n\ge 8n≥8 nodes with unit edge capacities, and suppose that for a constant c>0c>0c>0

∣⟨U,Uˉ⟩∣ ≥ c min⁡{∣U∣,∣Uˉ∣}for all U⊆V.|\langle U,\bar U\rangle|\ \ge\ c\,\min\{|U|,|\bar U|\}\qquad\text{for all }U\subseteq V .∣⟨U,Uˉ⟩∣ ≥ cmin{∣U∣,∣Uˉ∣}for all U⊆V.

Write log⁡\loglog for log⁡2\log_2log2​, and let fff and S\mathcal SS be the max-flow and the min-cut of the uniform multicommodity flow problem on GGG. Then

f ≤ 6 Sc (⌊log⁡n⌋−2).f\ \le\ \frac{6\,\mathcal S}{c\,\bigl(\lfloor\log n\rfloor-2\bigr)} .f ≤ c(⌊logn⌋−2)6S​.

Since S\mathcal SS is the min-cut and f≤Sf\le\mathcal Sf≤S always holds, this shows that on bounded-degree expanders the max-flow is a Θ(log⁡n)\Theta(\log n)Θ(logn) factor smaller than the min-cut, so the O(log⁡n)O(\log n)O(logn) gap of Theorem 2 is tight.

Formalization Note The paper's display has log⁡n−2\log n-2logn−2; the argument (a ball of radius ⌊log⁡n⌋−3\lfloor\log n\rfloor-3⌊logn⌋−3 in a 3-regular graph has fewer than n/2n/2n/2 nodes) proves the bound with ⌊log⁡n⌋−2\lfloor\log n\rfloor-2⌊logn⌋−2, which is what is stated: the same Θ(log⁡n)\Theta(\log n)Θ(logn), a different constant. The hypothesis n≥8n\ge 8n≥8 makes ⌊log⁡n⌋−2≥1\lfloor\log n\rfloor-2\ge 1⌊logn⌋−2≥1. Commodities are ordered pairs of demand 1/21/21/2 (footnote 2, p. 791); the min-cut ranges over nonempty proper cuts; the max-flow is the supremum of feasible concurrent fractions.

Preamble
import Mathlib
import Definitions.Def_LeightonRao_BadExample_Setting

set_option autoImplicit false
open scoped BigOperators
Formal statement
namespace LeightonRao.BadExample

/-- §2.1 display, pp. 794–795: on a 3-regular `n`-node graph with unit capacities and
`|⟨U, Ū⟩| ≥ c min{|U|, |Ū|}` for all `U`, with `n ≥ 8`, the uniform max-flow satisfies
`f ≤ 6𝒮/(c(⌊log₂ n⌋ − 2))`. -/
theorem flow_le_of_expander {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (h3 : G.IsRegularOfDegree 3)
    (c : ℝ) (hc : 0 < c) (hexp : IsEdgeExpander G c)
    (hn : 8 ≤ Fintype.card V) :
    maxFlow (unitNetwork G) uniformDemand ≤
      6 * minCut (unitNetwork G) /
        (c * ((Nat.log 2 (Fintype.card V) : ℝ) - 2)) := by sorry

end LeightonRao.BadExample
Source
Leighton and Rao, Multicommodity max-flow min-cut theorems and their use in designing approximation algorithms, J. ACM 46 (1999), pp. 794–795, §2.1, final display (f ≤ 6𝒮/(c(log n − 2)))
Human review
  • Endorsed by Shuze Chen · Oct 6, 2026

    Confirmed by the moderator at approval.

  • Endorsed by mikedeng1 · Oct 6, 2026

    Confirmed by the mission captain (proposal self-audit).

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