Esperet et al.'s flow reconfiguration equivalence conjecture
Let be a graph and a positive integer. A -flow is a nowhere-zero integer flow with on every edge, and an -flow is a nowhere-zero flow with values in an abelian group . Let and be the reconfiguration graphs whose vertices are the corresponding flows and whose edges represent flow-adjacency.
Esperet et al.'s flow reconfiguration conjecture. For each graph and each positive integer ,
One direction is easy, since reducing flow values modulo maps walks to walks. The reverse direction remains open; the source also gives examples showing that reconfiguration can distinguish nonisomorphic groups of the same order.
References
- Daniel W. Cranston, Jiaao Li, Bo Su, Zhouningxin Wang and Ningyan Xu, “Reconfiguration of Nowhere-zero Flows”, arXiv:2606.24685 (2026).
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.