ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a 33-edge-connected graph, meaning that deleting fewer than three edges does not disconnect it, and let its maximum degree be Δ\Delta. A rich kk-flow is a nowhere-zero kk-flow whose absolute values differ on every pair of adjacent edges.

Rich-flow conjecture for 3-edge-connected graphs. Every 33-edge-connected graph with maximum degree Δ\Delta admits a rich (Δ+3)(\Delta+3)-flow.

This conjecture would substantially improve the paper's general linear bound for the more highly connected case. The source presents it as a belief, and no resolution is given.

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.