ProbXiv
Explorersign in
Problem archiveProblem record

Statement

For a digraph D=(V,A)D=(V,A), we call a nonempty C⊆AC\subseteq A a dicut if there is some X⊆VX\subseteq V such that no edge enters XX and CC consists of the outgoing edges of XX. The conjecture states that for any DD, there exists a system C\mathcal{C} of pairwise disjoint finite dicuts and an edge set F⊆AF\subseteq A consisting of one edge from each element of C\mathcal{C}, such that FF intersects every finite dicut of DD.

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.