Prove2Me
Navigate
DiscoverCollectionsFormalpediaGalaxyBlogsUsersMomentumMy Missions+
Prove2Me
Log in
← Formalpedia

Directed edge-Menger theorem in edge-deletion form

Proved
DirKECC1549.Main.edge_menger_avoid

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

directed-graphsedge-connectivitymengers-theorem

Let DDD be a finite directed multigraph, x,yx,yx,y vertices, and k≥0k\ge0k≥0. Then DDD contains kkk pairwise edge-disjoint directed trails from xxx to yyy if and only if, after deleting any set of fewer than kkk edges, there remains a directed walk from xxx to yyy:

k pairwise edge-disjoint directed x–y trails exist⟺∀F⊆E(D), ∣F∣<k  ⟹  x reaches y in D−F.\text{$k$ pairwise edge-disjoint directed $x$–$y$ trails exist} \quad\Longleftrightarrow\quad \forall F\subseteq E(D),\ |F|<k\implies x\text{ reaches }y\text{ in }D-F.k pairwise edge-disjoint directed x–y trails exist⟺∀F⊆E(D), ∣F∣<k⟹x reaches y in D−F.

This is the directed edge form of Menger’s theorem, expressed in terms of resilience to edge deletion. Distinct edge identifiers account for parallel edges, and loops are allowed. If x=yx=yx=y, the empty walk and arbitrarily many empty trails satisfy both sides; if k=0k=0k=0, both sides hold vacuously.

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

theorem edge_menger_avoid {n m : ℕ} (D : Fin m → Fin n × Fin n) (k : ℕ)
    (x y : Fin n) : HasDisjointPaths D k x y ↔
    ∀ F : Finset (Fin m), F.card < k → ∃ p, IsWalk D x p y ∧
      ∀ e ∈ p, e ∉ F := by sorry
end DirKECC1549.Main
Source
Directed edge-Menger theorem, EPFL Graph Theory lecture notes, Lecture 9, Section 1, https://www.epfl.ch/labs/disopt/wp-content/uploads/2019/11/GT19_notes_to_date.pdf ; also Georgiadis et al., STOC 2027 submission #1549, Section 2 p.9. This is an edge-deletion formulation for the mission's graph encoding.

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