ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a rich flow admissible graph with maximum degree Δ\Delta. A pair of edges is confluent when the relevant flow values coincide in the sense used by the paper; a nowhere-zero kk-flow is a Z\mathbb{Z}-flow with nonzero edge values of absolute value less than kk.

Confluent-edge-free flow conjecture. Every rich flow admissible graph with maximum degree Δ\Delta has a nowhere-zero O(ln⁡(Δ))O(\ln(\Delta))-flow containing no pair of confluent edges.

The source contrasts this with the linear behavior obtained when both confluent and contrafluent pairs are forbidden. It gives no proof or resolution of the proposed logarithmic bound.

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.