The large-support 3-flow conjecture for 2-edge-connected graphs
Statement
Let be a graph, and let denote its edge set. A 3-flow on is a flow whose values lie in a group of order three, and its support is the set of edges on which the flow is nonzero. Large-support 3-flow conjecture. Every 2-edge-connected graph has a 3-flow satisfying
The paper presents this as a proposed extension of its methods beyond 3-edge-connected graphs; its status is not resolved in the supplied text.
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.