ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D=(V,A)D=(V,A) be a digraph with arc weights wi{0,1}Aw i\{0,1\}^A. The weight of a dicut is the sum of the weights of its arcs, and the minimum dicut weight is the smallest such weight. The digraph packs kk dijoins if it has kk dijoins such that no arc ee belongs to more than w(e)w(e) of them.

Edmonds–Giles conjecture. If the minimum weight of a dicut is τ\tau, then DD can pack τ\tau dijoins.

The conjecture was disproved by Schrijver, so the corresponding weighted packing assertion is false; its unweighted version is Woodall's still-open conjecture.

Record

Comments

Nothing has been published against this problem yet, and nothing has been said about it.

Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.

Sign in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.