Logarithmic bound for confluent-edge-free flows
Statement
Let be a rich flow admissible graph with maximum degree . A pair of edges is confluent when the relevant flow values coincide in the sense used by the paper; a nowhere-zero -flow is a -flow with nonzero edge values of absolute value less than .
Confluent-edge-free flow conjecture. Every rich flow admissible graph with maximum degree has a nowhere-zero -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.