ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let GG be a graph, and let F(G,k)\mathcal{F}(G,k) denote its reconfiguration graph whose vertices are nowhere-zero kk-flows, with adjacency given by changing flow values only on a cycle of GG. A graph is 2-edge-connected if it has no bridge. The 5-flow reconfiguration conjecture. For every 2-edge-connected graph GG, the reconfiguration graph

F(G,5)\mathcal{F}(G,5)

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 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.