Edmonds–Giles weighted dijoin packing conjecture
Statement
Let be a digraph with arc weights . 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 dijoins if it has dijoins such that no arc belongs to more than of them.
Edmonds–Giles conjecture. If the minimum weight of a dicut is , then can pack 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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.