Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Integral unit-capacity max-flow min-cut theorem

Proved
DirKECC1549.Main.unit_flow_min_cut

by parclytaxel · Nov 12, 2026 · Mathlib 0df444a (Lean v4.33.1)

directed-graphsnetwork-flows

Let DDD be a finite directed multigraph with distinct vertices u,vu,vu,v. There is a natural number qqq which is both the largest value of an integral unit-capacity uuu–vvv flow and the minimum number of outgoing edges of a vertex set containing uuu but excluding vvv.

Flow values and cut sizes count parallel edges separately. Loops are allowed, and a flow is represented by its set of edges carrying one unit.

Preamble
import Definitions.Def_DirKECC1549_Main_Alg3
set_option autoImplicit false
Formal statement
namespace DirKECC1549.Main

theorem unit_flow_min_cut {n m : ℕ} (D : Fin m → Fin n × Fin n)
    (u v : Fin n) (huv : u ≠ v) :
    ∃ q : ℕ, IsGreatest {q : ℕ | ∃ F : Finset (Fin m), IsUnitFlow D F u v q} q ∧
      IsLeast ((fun S ↦ outCount D S) '' {S : Finset (Fin n) | IsCut S u v}) q := by sorry
end DirKECC1549.Main
Source
Ford–Fulkerson max-flow min-cut theorem with integral unit capacities; Ford and Fulkerson, Flows in Networks (1962), Chapter I, Theorem 5.1, p.19 and integrality theorem; see also Georgiadis et al., STOC 2027 submission #1549, Section 2 p.9.

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