Woodall's conjecture
Statement
Let be a finite directed graph. For a set with and , write
Call a of if , i.e. every edge crossing the partition leaves . A set is a of if for every dicut of ; equivalently, contracting the edges of yields a strongly connected directed graph.
Suppose has at least one dicut, and let
Then there exist pairwise disjoint sets such that each is a dijoin of .
Record
- Added
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.