Nowhere-zero flow reconfiguration in every finite abelian group of order at least 3024
Version 1 / Nov 16, 2026 / CC BY-SA 4.0
Abstract
For a finite multigraph and a finite abelian group , let be the graph on the nowhere-zero -flows of in which two flows are adjacent if the support of their difference is a cycle. We prove that is connected for every finite bridgeless multigraph and every finite abelian group of order at least . The previous bound for all finite abelian groups, due to Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner, is a number with digits; for the cyclic groups of prime order their bound is . A theorem of an earlier paper of the author covers every group that is not cyclic of prime-power order and whose order has a divisor with ; from the order on, it leaves only the cyclic groups whose order is a prime power, twice a prime or three times a prime. For a cyclic factor we use units of as scales, and we average over a set of scales that is generated by good units. Counts of the bad units settle the orders from on, and a finite arithmetic certificate with rows settles the orders from to .
Provenance statement
References
- D. Goel, Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite -degenerate graphs , version 2.30, Zenodo, 2026, https://doi.org/10.5281/zenodo.23603238.DOI
- D. W. Cranston, J. Li, B. Su, Z. Wang, and N. Xu, Reconfiguration of nowhere-zero flows , arXiv:2606.24685v1, 2026.arXiv
- L. Esperet, K. Hendrey, A. Lagoutte, M. Marseloo, S. Norin, and R. Steiner, Nowhere-zero flow reconfiguration , arXiv:2512.17342v4 (https://arxiv.org/abs/2512.17342v4), July 3, 2026.arXiv
- P. D. Seymour, Nowhere-zero -flows , J. Combin. Theory Ser. B 30 (1981), 130--135.