Infinite Lucchesi-Younger
Statement
For a digraph , we call a nonempty a dicut if there is some such that no edge enters and consists of the outgoing edges of . The conjecture states that for any , there exists a system of pairwise disjoint finite dicuts and an edge set consisting of one edge from each element of , such that intersects every finite dicut of .
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.