Rich flows for 3-edge-connected graphs
Statement
Let be a -edge-connected graph, meaning that deleting fewer than three edges does not disconnect it, and let its maximum degree be . A rich -flow is a nowhere-zero -flow whose absolute values differ on every pair of adjacent edges.
Rich-flow conjecture for 3-edge-connected graphs. Every -edge-connected graph with maximum degree admits a rich -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 inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.