Integer and modular flow reconfiguration: the moduli up to six, chords, and large moduli
Version 1 / Nov 16, 2026 / CC BY-SA 4.0
Abstract
For a finite multigraph and an integer , let be the graph on the nowhere-zero -flows of , and the graph on the integer flows of with on every edge; a step adds a nonzero constant along one cycle. The Esperet–Hendrey–Lagoutte–Marseloo–Norin–Steiner (2025) lifting question asks for a proof that is connected whenever is connected; its authors write that they do not know how to prove this even for . We prove it for and every graph, in a stronger form: reduction modulo induces a bijection between the components of and of . We prove the same for every on the graphs in which every cycle with more than nine edges has a chord between two vertices that are not neighbors on the cycle. We also prove that is connected for every bridgeless multigraph and every , where is the largest number of edges of a cut of ; and that scaling by carries the components of into components of . With a theorem of Esperet et al. on planar graphs, the first result settles the question for every planar graph and every . The bijection of the components for holds more generally for the integer and modular kernel vectors of every totally unimodular matrix, with the circuit vectors as steps, and in this generality it fails at every prime , for the tensions of a graph on vertices; this does not answer the question for the flows of graphs. For the six moduli we prove the bijection of the components for every graph also; this is a short deduction from a lemma on liftable steps of a companion paper. For the other this paper does not settle the question on arbitrary graphs.
Provenance statement
References
- L. Esperet, K. Hendrey, A. Lagoutte, M. Marseloo, S. Norin, R. Steiner, Nowhere-zero flow reconfiguration , arXiv:2512.17342v4 (3 July 2026).arXiv
- D. W. Cranston, J. Li, B. Su, Z. Wang, N. Xu, Reconfiguration of nowhere-zero flows , arXiv:2606.24685v1 (June 23, 2026).arXiv
- A. Schrijver, A Course in Combinatorial Optimization , lecture notes, 23 March 2017, Section 4.5, Theorems 4.6 and 4.7, https://homepages.cwi.nl/~lex/files/dict.pdf.link
- D. Goel, Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite -degenerate graphs , version 2.30, October 23, 2026, Part I, https://doi.org/10.5281/zenodo.23603238.DOI
- D. Goel, The Cranston--Li--Su--Wang--Xu ( 2026 ) conjecture is true, with extensions to graphs with few vertices of odd degree , version 2.30, October 23, 2026, https://doi.org/10.5281/zenodo.23605839.DOI
- W. T. Tutte, A class of Abelian groups , Canadian Journal of Mathematics 8 (1956), 13--28, https://doi.org/10.4153/CJM-1956-004-9.DOI
- J. Oxley, Matroid Theory , second edition, Oxford University Press, 2011, Corollary 10.3.5.