Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

§2.1, p. 794 — in a 3-regular n-node graph at least half of the source–sink pairs are at distance ≥ ⌊log n⌋ − 2

Proved
LeightonRao.BadExample.half_pairs_far

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

expander-graphgraph-distancep2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1regular-graph

Let GGG be a 3-regular graph on n≥8n\ge 8n≥8 nodes and write log⁡\loglog for log⁡2\log_2log2​. Then at least n2/2n^2/2n2/2 of the n2n^2n2 ordered pairs (s,t)(s,t)(s,t) of nodes have graph distance

dG(s,t) ≥ ⌊log⁡n⌋−2.d_G(s,t)\ \ge\ \lfloor\log n\rfloor-2 .dG​(s,t) ≥ ⌊logn⌋−2.

In particular at least half of the (n2)\binom n2(2n​) commodities of the uniform multicommodity flow problem on GGG have a shortest source–sink path with at least ⌊log⁡n⌋−2\lfloor\log n\rfloor-2⌊logn⌋−2 edges.

This is the step that forces every routing of the uniform flow on GGG to use long paths.

Formalization Note Pairs are counted as ordered pairs over V×VV\times VV×V; a pair with s=ts=ts=t has distance 0<⌊log⁡n⌋−20<\lfloor\log n\rfloor-20<⌊logn⌋−2 and is never counted, and n2/2n^2/2n2/2 ordered pairs give at least 12(n2)\tfrac12\binom n221​(2n​) unordered ones. The paper's log⁡n−2\log n-2logn−2 is stated with the floor ⌊log⁡n⌋−2\lfloor\log n\rfloor-2⌊logn⌋−2, which is what the ball bound yields (a printed slip for non-integer log⁡n\log nlogn). Distances are extended graph distances (∞\infty∞ across components).

Preamble
import Mathlib
import Definitions.Def_LeightonRao_BadExample_Setting

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

/-- §2.1, p. 794: in a 3-regular graph on `n ≥ 8` nodes, at least `n²/2` ordered pairs
`(s, t)` are at graph distance at least `⌊log₂ n⌋ − 2`. -/
theorem half_pairs_far {V : Type} [Fintype V] [DecidableEq V]
    (G : SimpleGraph V) [DecidableRel G.Adj]
    (h3 : G.IsRegularOfDegree 3)
    (hn : 8 ≤ Fintype.card V) :
    (Fintype.card V : ℝ) ^ 2 / 2 ≤
      ((Finset.univ.filter (fun p : V × V =>
        ((Nat.log 2 (Fintype.card V) - 2 : ℕ) : ℕ∞) ≤ G.edist p.1 p.2)).card : ℝ) := 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), p. 794, §2.1, second paragraph after the min-cut display
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