The 5-flow reconfiguration conjecture
Statement
Let be a graph, and let denote its reconfiguration graph whose vertices are nowhere-zero -flows, with adjacency given by changing flow values only on a cycle of . A graph is 2-edge-connected if it has no bridge. The 5-flow reconfiguration conjecture. For every 2-edge-connected graph , the reconfiguration graph
is connected. This is a reconfiguration analogue of the existence question in Tutte's 5-flow conjecture; unlike existence, connectedness does not imply that the reconfiguration graph is nonempty, and the conjecture remains open.
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.