Integer and modular flow reconfiguration: the moduli up to six, chords, and large moduli

A mix of human-written and AI-generated textHuman understanding: some partsmath.CO — Combinatorics

Contributed by Dave Goel ↗

Version 1 / Nov 16, 2026 / CC BY-SA 4.0

Abstract

For a finite multigraph GG and an integer k≥2k\ge2, let Mk(G)\mathcal M_k(G) be the graph on the nowhere-zero Zk\mathbb Z_k-flows of GG, and Ik(G)\mathcal I_k(G) the graph on the integer flows FF of GG with 1≤∣F(e)∣≤k−11\le|F(e)|\le k-1 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 Ik(G)\mathcal I_k(G) is connected whenever Mk(G)\mathcal M_k(G) is connected; its authors write that they do not know how to prove this even for k=4k=4. We prove it for k=2,3,4,5,6k=2,3,4,5,6 and every graph, in a stronger form: reduction modulo kk induces a bijection between the components of Ik(G)\mathcal I_k(G) and of Mk(G)\mathcal M_k(G). We prove the same for every kk 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 Ik(G)\mathcal I_k(G) is connected for every bridgeless multigraph GG and every k≥mc⁡(G)+2k\ge\operatorname{mc}(G)+2, where mc⁡(G)\operatorname{mc}(G) is the largest number of edges of a cut of GG; and that scaling by mm carries the components of Mk(G)\mathcal M_k(G) into components of Imk(G)\mathcal I_{mk}(G). With a theorem of Esperet et al. on planar graphs, the first result settles the question for every planar graph and every kk. The bijection of the components for k≤6k\le6 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 p≥7p\ge7, for the tensions of a graph on 2p2p vertices; this does not answer the question for the flows of graphs. For the six moduli k=8,9,12,16,18,36k=8,9,12,16,18,36 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 k≥7k\ge7 this paper does not settle the question on arbitrary graphs.

Author comments: First version: October 23, 2026.

Provenance statement

This work was done overwhelmingly by AI models and supervised by the author. The models were Anthropic's Claude and OpenAI's ChatGPT. The author takes full responsibility for the paper.

References

  1. L. Esperet, K. Hendrey, A. Lagoutte, M. Marseloo, S. Norin, R. Steiner, Nowhere-zero flow reconfiguration , arXiv:2512.17342v4 (3 July 2026).arXiv
  2. D. W. Cranston, J. Li, B. Su, Z. Wang, N. Xu, Reconfiguration of nowhere-zero flows , arXiv:2606.24685v1 (June 23, 2026).arXiv
  3. 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
  4. D. Goel, Flow reconfiguration with one modulus for all graphs, and Cereceda's conjecture for bipartite 22-degenerate graphs , version 2.30, October 23, 2026, Part I, https://doi.org/10.5281/zenodo.23603238.DOI
  5. 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
  6. 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
  7. J. Oxley, Matroid Theory , second edition, Oxford University Press, 2011, Corollary 10.3.5.

Version history

  1. v1 · 23 pagesSubmitted by Dave GoelFirst version: October 23, 2026.CurrentNov 16, 2026