Reconfiguration of nowhere-zero flows on even graphs
A nowhere-zero flow assigns a nonzero value to every oriented edge and balances the values entering and leaving each vertex. A move adds a fixed nonzero value around one cycle, with signs determined by orientation. Can any two flows on a graph with all degrees even be connected by moves that keep every edge value nonzero?
Why it matters and what counts as progress
Why it matters: A graph may have many valid flows even when local changes are tightly constrained. Connectivity tells us when those changes can reach every valid configuration.
What counts as progress: Prove that cycle moves connect all flows for a stated value group or integer range, or construct a graph and two flows that no sequence of valid moves can connect.
How the problem developed
- June 2026 · Conjecture and partial cases [3]
Daniel Cranston, Jiaao Li, Bo Su, Zhouningxin Wang and Ningyan Xu Proved connectivity in the even-order and even-k cases and formulated the threshold conjecture.
Dave Goel with Claude and ChatGPT Released the Lean-checked version covering every finite abelian group of order at least four and every integer k of at least four.
AI contribution
The Cranston--Li--Su--Wang--Xu (2026) conjecture is true
On a finite graph whose vertex degrees are all even, any two nowhere-zero flows over a finite abelian group of order at least 4 are connected by cycle moves. The same holds for integer flows with absolute edge values between 1 and for each integer .
Sources
Publication history
Daily emails by default, only when there’s an update.