ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let D=(V,E)D=(V,E) be a finite directed graph. For a set S⊆VS\subseteq V with S≠∅S\neq\emptyset and S≠VS\neq V, write

∂+(S)={ uv∈E:u∈S, v∈V∖S },∂−(S)={ uv∈E:u∈V∖S, v∈S }.\partial^+(S)=\{\,uv\in E: u\in S,\ v\in V\setminus S\,\},\qquad \partial^-(S)=\{\,uv\in E: u\in V\setminus S,\ v\in S\,\}.

Call ∂+(S)\partial^+(S) a dicut\emph{dicut} of DD if ∂−(S)=∅\partial^-(S)=\emptyset, i.e. every edge crossing the partition {S,V∖S}\{S,V\setminus S\} leaves SS. A set J⊆EJ\subseteq E is a dijoin\emph{dijoin} of DD if J∩C≠∅J\cap C\neq\emptyset for every dicut CC of DD; equivalently, contracting the edges of JJ yields a strongly connected directed graph.

Suppose DD has at least one dicut, and let

k=min⁡{ ∣C∣:C is a dicut of D }.k=\min\{\,|C| : C \text{ is a dicut of } D\,\}.

Then there exist pairwise disjoint sets J1,…,Jk⊆EJ_1,\dots,J_k\subseteq E such that each JiJ_i is a dijoin of DD.

Record

Added
Links

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.