\documentclass[11pt]{amsart} \usepackage[T1]{fontenc} \usepackage{amsmath,amssymb,amsthm} \usepackage[margin=1.2in]{geometry} \usepackage[colorlinks=true,allcolors=blue]{hyperref} \newtheorem{theorem}{Theorem}[section] \newtheorem{lemma}[theorem]{Lemma} \newtheorem{corollary}[theorem]{Corollary} \newtheorem{proposition}[theorem]{Proposition} \theoremstyle{definition} \newtheorem{remark}[theorem]{Remark} \newtheorem{definition}[theorem]{Definition} \newcommand{\Z}{\mathbb Z} \newcommand{\R}{\mathbb R} \newcommand{\mc}{\operatorname{mc}} \newcommand{\diver}{\operatorname{div}} \newcommand{\supp}{\operatorname{supp}} \newcommand{\Ical}{\mathcal I} \newcommand{\Mcal}{\mathcal M} \newcommand{\Fcal}{\mathcal F} \newcommand{\Gam}{\Gamma} \newcommand{\Fl}{\Fcal} \newcommand{\Ik}[1][k]{\Ical_{#1}} \newcommand{\Mk}[1][k]{\Mcal_{#1}} \newcommand{\cF}{\mathcal F} \newenvironment{condlist}[1]{\begin{list}{}{% \settowidth{\labelwidth}{\textup{#1}}\setlength{\labelsep}{0.5em}% \setlength{\leftmargin}{\labelwidth}\addtolength{\leftmargin}{\labelsep}% \setlength{\itemsep}{2pt}\setlength{\topsep}{4pt}\setlength{\parsep}{2pt}\setlength{\listparindent}{0pt}}}% {\end{list}} \begin{document} \title[Integer and modular flow reconfiguration]{Integer and modular flow reconfiguration: the moduli up to six, chords, and large moduli} \author{Dave Goel} \dedicatory{\upshape\footnotesize Version 1.20, October 23, 2026.} \begin{abstract} For a finite multigraph $G$ and an integer $k\ge2$, let $\Mcal_k(G)$ be the graph on the nowhere-zero $\Z_k$-flows of $G$, and $\Ical_k(G)$ the graph on the integer flows $F$ of $G$ with $1\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 $\Ical_k(G)$ is connected whenever $\Mcal_k(G)$ is connected; its authors write that they do not know how to prove this even for $k=4$. We prove it for $k=2,3,4,5,6$ and every graph, in a stronger form: reduction modulo $k$ induces a bijection between the components of $\Ical_k(G)$ and of $\Mcal_k(G)$. We prove the same for every $k$ 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 $\Ical_k(G)$ is connected for every bridgeless multigraph $G$ and every $k\ge\mc(G)+2$, where $\mc(G)$ is the largest number of edges of a cut of $G$; and that scaling by $m$ carries the components of $\Mcal_k(G)$ into components of $\Ical_{mk}(G)$. With a theorem of Esperet et al.\ on planar graphs, the first result settles the question for every planar graph and every $k$. The bijection of the components for $k\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\ge7$, for the tensions of a graph on $2p$ vertices; this does not answer the question for the flows of graphs. For the six moduli $k=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\ge7$ this paper does not settle the question on arbitrary graphs. \end{abstract} \maketitle \section{Introduction} Graphs are finite multigraphs; loops and parallel edges are allowed. Let $k\ge2$ be an integer. A \emph{modular flow} is a nowhere-zero $\Z_k$-flow of $G$, and an \emph{integer $k$-flow} is an integer circulation $F$ with $1\le|F(e)|\le k-1$ on every edge. A \emph{step} adds a nonzero constant along one cycle, and it is legal if the result is again a flow of the same kind. $\Mcal_k(G)$ is the graph on the modular flows and $\Ical_k(G)$ the graph on the integer $k$-flows, with the legal steps as edges. These are the graphs $\Fcal(G,\Z_k)$ and $\Fcal(G,k)$ of Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner~\cite{EHLMNS}. The exact definitions are in Section~2, for the second part of the paper in Section~7, and for matrices in Section~12. \subsection*{The lifting question} Reduction modulo $k$ maps integer $k$-flows onto modular flows, and an integer step to a modular step or to equality. So, if $\Ical_k(G)$ is connected, then $\Mcal_k(G)$ is connected; this is Observation~2.5 of~\cite{EHLMNS}. The converse is the Esperet--Hendrey--Lagoutte--Marseloo--Norin--Steiner (2025) \emph{lifting question}, their Problem~2.6: \begin{quote} ``Let $G$ be a graph and $k$ be an integer. Prove that if $\mathcal F(G,\Z_k)$ is connected, then $\mathcal F(G,k)$ is also connected.'' \end{quote} They write directly after it: ``We do not know how to prove the result even in the case $k=4$.'' Cranston, Li, Su, Wang and Xu state the equivalence of the two connectivity properties as a conjecture~\cite[Conjecture~A]{CLSWX}. \subsection*{The results} \begin{theorem}\label{thm:intro} Let $G$ be a finite multigraph, and let $k\ge2$ be an integer. \begin{enumerate} \item[\textup{(a)}] If $k\le6$, then reduction modulo $k$ induces a bijection between the connected components of $\Ical_k(G)$ and of $\Mcal_k(G)$. \item[\textup{(b)}] Suppose that every cycle of $G$ with more than nine edges has an edge outside the cycle joining two distinct vertices that are not neighbors on the cycle. Then the conclusion of \textup{(a)} holds for every $k\ge2$. For $k=7$ it holds with nine replaced by twenty-one. \item[\textup{(c)}] If $G$ is bridgeless and $k\ge\mc(G)+2$, where $\mc(G)$ is the largest number of edges of a cut of $G$, then $\Ical_k(G)$ is connected. \end{enumerate} \end{theorem} Part~(a) is Theorem~\ref{thm:smallmod}, part~(b) is Theorem~\ref{thm:main}, and part~(c) is Theorem~\ref{l:thm:main}. In the cases (a) and (b), $\Ical_k(G)$ is connected if and only if $\Mcal_k(G)$ is connected; so the implication of the lifting question holds there, for $k=4$ in particular. The statement on the components says more: $\Mcal_k(G)$ need not be connected (for six parallel edges and $k=3$ it is not~\cite[Theorem~2.1]{CLSWX}), and then $\Ical_k(G)$ has exactly as many components, and reduction modulo $k$ matches them. In case~(c) the graph $\Mcal_k(G)$ is connected as well, by reduction and lifting (Lemma~\ref{lem:fibres}); so for these pairs $(G,k)$ both graphs are connected. For simple graphs the hypothesis of~(b) says that no induced cycle has more than nine edges. For planar graphs, part~(a) and a theorem of~\cite{EHLMNS} leave no modulus open. \begin{corollary}\label{cor:planar} Let $G$ be a planar multigraph, and let $k\ge2$ be an integer. Then $\Ical_k(G)$ is connected if and only if $\Mcal_k(G)$ is connected. \end{corollary} \begin{proof} For $k\le6$ this follows from Theorem~\ref{thm:intro}\,(a). Let $k\ge7$; we show that both graphs are connected. As in Section~2, a reconfiguration graph with at most one vertex is regarded as connected. If $G$ has a bridge, then $G$ has no flow of either kind, and both graphs are empty. Suppose that $G$ is bridgeless. A loop is a cycle, and a step on it changes the value of this loop only, to any other allowed value; and every cycle that is not a loop lies in one component of $G$. So each of $\Ical_k(G)$ and $\Mcal_k(G)$ is the Cartesian product of the corresponding graphs of the components of the graph $G$ without its loops, and of one complete graph for each loop. A component without an edge has one flow of each kind, the empty map. Every other component is a $2$-edge-connected loopless planar graph, and its two reconfiguration graphs are connected by~\cite[Corollary~5.9]{EHLMNS}. A finite product of nonempty connected graphs is connected, and a product with an empty factor is empty. \end{proof} For $k\ge7$ we prove the statement of the lifting question on arbitrary graphs only at the six moduli $8$, $9$, $12$, $16$, $18$ and $36$ (Theorem~\ref{t2c:thm:main}; see ``Six more moduli'' below). For the other $k\ge7$ this paper does not settle it on arbitrary graphs; by Corollary~\ref{cor:planar}, a graph for which it is not settled here is not planar. The smallest such modulus is $k=7$: by Corollary~\ref{cor:unitsteps} and Theorem~\ref{thm:short}, the only modular steps that are not treated there have size $3$ or $4$ and lie on cycles with at least twenty-two edges. That this paper does not settle a modulus does not mean that it is open: at $k=40$, at $k=48$ and at every multiple $k$ of $4$ with $k\ge52$ the earlier paper~\cite{GoelOneModulus} proves that both graphs of flows are connected for every graph with no bridge and no loop (see ``What was known, and two companion papers'' below). \subsection*{Six more moduli} For $k=8,9,12,16,18,36$ the conclusion of part~(a) of Theorem~\ref{thm:intro} holds for every graph: this is Theorem~\ref{t2c:thm:main}. Its proof, in Sections~\ref{t2c:sec:statement} to~\ref{t2c:sec:proofs}, is a short deduction from a lemma of the earlier paper~\cite{GoelOneModulus} on the steps that can be lifted \textup{(}its Lemma~1.12\textup{)}: at each of the six moduli, every element other than $0$ is one of the elements that the lemma names. The six moduli were found in the work on that paper and are not stated in it. Section~\ref{p1:sec:tools} names the four statements of~\cite[Section~1]{GoelOneModulus} that the proof uses; their proofs are there. Corollary~\ref{t2c:cor:odd} applies the theorem, with two results of the companion paper~\cite{GoelEulerian} on the $\Z_k$-flows, to the graphs in which every connected component has at most eight, at most twelve, or at most twenty-four vertices of odd degree. The theorem and the corollary make no statement on any other modulus $k\ge7$, and we give no classification of the moduli for which this deduction works; the modulus $7$ is not one of them \textup{(}Remark~\ref{t2c:rem:seven}\textup{)}. \subsection*{Totally unimodular matrices} Part~(a) of Theorem~\ref{thm:intro} is not special to graphs. Let $A$ be a finite integer matrix with column set $E$ that is \emph{totally unimodular}: each square subdeterminant is $0$, $1$ or $-1$. An \emph{integer $k$-flow of $A$} is a vector $F\in\Z^E$ with $AF=0$ and $1\le|F_e|\le k-1$ for every $e$, and a \emph{modular $k$-flow of $A$} is a vector $f\in(\Z_k)^E$ with $Af=0$ in $\Z_k$ and $f_e\ne0$ for every $e$. A \emph{circuit vector} is an integer vector in the kernel of $A$ whose support is not empty and is minimal among the supports of the nonzero real kernel vectors, and whose nonzero entries have greatest common divisor one; its entries are $0$, $1$ and $-1$ (Lemma~\ref{r:lem:decompose}). A step adds a nonzero multiple of a circuit vector. $\Ical_k(A)$ and $\Mcal_k(A)$ are the graphs on the integer and on the modular $k$-flows of $A$, with the legal steps as edges. The exact definitions are in Section~12. \begin{theorem}\label{thm:intro-matrix} The following two statements hold. \begin{enumerate} \item[\textup{(a)}] For every totally unimodular matrix $A$ and every $k\in\{2,3,4,5,6\}$, reduction modulo $k$ induces a bijection between the connected components of $\Ical_k(A)$ and of $\Mcal_k(A)$. \item[\textup{(b)}] For every prime $p\ge7$ there is a totally unimodular matrix $A$, representing the tension space of a finite simple graph, for which reduction modulo $p$ does not induce an injection on connected components: a component of $\Mcal_p(A)$ with two vertices has lifts in at least two different components of $\Ical_p(A)$. \end{enumerate} \end{theorem} Part~(a) is Theorem~\ref{r:thm:small}, and part~(b) is Theorem~\ref{r:thm:failure}. The integer kernels of totally unimodular matrices are regular chain groups in the sense of Tutte~\cite{Tutte}. If $A$ is the oriented incidence matrix of a graph $G$, then the flows of $A$ are the flows of $G$ and the circuit vectors are the signed indicator vectors of the cycles of $G$; so for graphs part~(a) is Theorem~\ref{thm:intro}\,(a) again. Its proof in Sections~12 to~14 is shorter than the proof in Sections~3 to~6: it rounds a real vector directly and uses no cut condition and no count of intervals. This shorter proof is not new for graphs: it is the proof by the lemmas of~\cite{GoelOneModulus}, carried over to matrices (see ``Relation to our earlier paper'' below). Part~(b) refutes the bijection of the components in the wider setting; it does not refute the implication of the lifting question, and it is not a statement on the flows of a graph. Its matrices represent \emph{tensions}, the vectors of the differences of a vertex potential along the edges, of a graph $H_p$ that consists of two complete graphs on $p$ vertices and of $p(p-2)$ edges between them. This graph contains $K_5$, so its tension space is not the flow space of a graph (see the remark at the end of Section~16); and the graph $\Mcal_p(A)$ of the example is not connected, so the example does not even contradict the statement ``if $\Mcal_p(A)$ is connected, then $\Ical_p(A)$ is connected''. What it shows is that a proof of the bijection of the components for the flows of all graphs at a prime $p\ge7$ cannot be a proof for all totally unimodular matrices. Theorem~\ref{thm:intro-matrix} claims nothing for composite moduli above six, and nothing for the flows of graphs at $k=7$. \subsection*{What was known, and two companion papers} Esperet et al.~\cite[Theorem~7.1]{EHLMNS} prove that $\Fcal(G,k)$ is connected at some modulus $k$ for each loopless $2$-edge-connected graph $G$; the modulus chosen in their proof is $36|E(G)|(|V(G)|+1)$. For planar graphs they prove more \cite[Corollary~5.9]{EHLMNS}: for every $2$-edge-connected planar graph $G$, every integer $k\ge7$ and every abelian group $A$ with at least seven elements, the graphs $\Fcal(G,k)$ and $\Fcal(G,A)$ are connected. So the lifting question was answered for these pairs $(G,k)$; their Corollaries~5.10 to~5.12 lower the bound $7$ for planar graphs of higher edge-connectivity and for outerplanar graphs. The graphs of~\cite{EHLMNS} may have multiple edges, but no loop. The paper~\cite{GoelOneModulus} proves that $\Mcal_k(G)$ and $\Ical_k(G)$ are both connected for every finite bridgeless loopless multigraph $G$ if $k=40$, if $k=48$, or if $k$ is a multiple of $4$ with $k\ge52$ \cite[Theorem~9.2]{GoelOneModulus}. For one fixed graph $G$ it gives every modulus from a bound on: every $k\ge\max(48,c(G)+4)$, where $c(G)$ is the number of edges of a longest cycle of $G$, and every $k\ge40$ if $c(G)\le39$ \cite[Corollary~10.6]{GoelOneModulus}; every $k\ge40$ if $G$ has at most $189$ edges \cite[Corollary~10.12]{GoelOneModulus} or at most $149$ vertices \cite[Corollary~10.16]{GoelOneModulus}. It claims nothing for a modulus below $40$ on all graphs, and nothing for a prime modulus on all graphs; but some statements of the present paper follow from its lemmas, and we say which under ``Relation to our earlier paper'' below. The paper~\cite{GoelEulerian} proves the Cranston--Li--Su--Wang--Xu (2026) conjecture~\cite[Conjecture~4.1]{CLSWX} for the integer flows: both graphs are connected for every graph with all degrees even and every $k\ge4$; and that the implication of the lifting question holds for these graphs for every $k\ge2$. Part~(c) of Theorem~\ref{thm:intro} is a bound of the same kind as the bound $\max(48,c(G)+4)$ of~\cite{GoelOneModulus}, with another parameter, and neither contains the other. For the complete graph $K_4$ we have $\mc(K_4)=4$, so (c) gives every $k\ge6$, and~\cite{GoelOneModulus} gives every $k\ge40$. For the complete bipartite graph $K_{3,n}$ with $n\ge3$ we have $c=6$ and $\mc=3n$, so~\cite{GoelOneModulus} gives every $k\ge40$, and (c) gives every $k\ge3n+2$. The proof of~(c) uses no base modulus: it uses Hoffman's circulation theorem and a walk through the regions of a hyperplane arrangement. \subsection*{More results} \begin{enumerate} \item[\textup{(i)}] Every legal modular step on a cycle with at most nine edges has two adjacent integer lifts, for every $k\ge3$; for $k=7$ the same holds for at most twenty-one edges (Theorem~\ref{thm:short}). \item[\textup{(ii)}] For every $k\ge3$, every legal modular step of size $1$, $-1$, $2$ or $-2$ has a pair of adjacent integer lifts (Corollary~\ref{cor:unitsteps}). \item[\textup{(iii)}] For $k=2d$ with $d\ge2$ and a legal modular step of size $d$, all integer lifts of both endpoints lie in one component of $\Ical_k(G)$ (Lemma~\ref{lem:half}). \item[\textup{(iv)}] Scaling: if two modular flows lie in one component of $\Mcal_k(G)$ and $F$, $F'$ are integer $k$-lifts of them, then $mF$ and $mF'$ lie in one component of $\Ical_{mk}(G)$, for every $m\ge2$ (Theorem~\ref{l:thm:scaling}). \item[\textup{(v)}] If $G$ is connected and bridgeless and $\{e,f\}$ is a cut of $G$, then $\Ical_k(G)$ and $\Ical_k(G/e)$ are isomorphic (Lemma~\ref{l:lem:two-cut}). \end{enumerate} \subsection*{Relation to our earlier paper} Several statements of this paper follow from lemmas of the paper~\cite{GoelOneModulus}, which treats loopless multigraphs, or were obtained together with it. We say here which, so that nothing old is read as new. \emph{Part~\textup{(a)} of Theorem~\ref{thm:intro}.} For every $k\ge3$, \cite[Lemma~1.12\,(a)--(d)]{GoelOneModulus} states that all integer lifts of one modular flow lie in one component of $\Ical_k(G)$, and that for a legal modular step of size $\pm1$, of size $\pm2$, or of size $\pm q$ for a divisor $q$ of $k$ with $1\le q0$, and an arc $v\to t$ of capacity $-d(v)$ to a new sink $t$ for each $d(v)<0$. Write $M=\sum_{d(v)>0}d(v)$. The cut with source side $\{s\}\cup U$ has capacity $(u-\ell)(\delta^+(U))+M-d(U)$. Thus all these cuts have capacity at least $M$ exactly when $d(U)\le(u-\ell)(\delta^+(U))$, which expands to~\eqref{eq:bounds}. An integral maximum flow of value $M$ saturates the added arcs; its restriction $w$ to the original edges has divergence $d$, so $z=\ell+w$ is the required map. The complement of $U$ gives the lower inequality. In particular, the criterion forces the sum of $b$ on each connected component to be zero. Loops impose no divergence constraint and are chosen independently. Fix a legal step $f\to f+c\chi_C$, where $c$ is represented by an integer in $\{1,\ldots,k-1\}$. Choose reference directions along $C$, and let $r(e)\in\{1,\ldots,k-1\}$ represent $f$. Put \[ b=\diver(r)/k,\qquad H=\{e\in E(C):r(e)>k-c\},\qquad L=\{e\in E(C):r(e)r(e)$. Such a contribution is at most $(k-1)-(k-c+1)=c-2$. Thus $c\le2$ permits no violation. Otherwise at least $\lceil k/(c-2)\rceil$ positive intervals are required. Their boundary edges are pairwise distinct and each interval uses two edges of $H$. If $U$ contains all or none of the cycle vertices, there is no positive contribution, so that case cannot violate~\eqref{eq:pos} either. This also deals with a loop cycle. For the assertion about $L$, reverse the cycle and its reference directions, replacing the cycle residues by $r'=k-r$ and the increment by $c'=k-c$. The new wrap set is $H'=L$. A lift accepting $k-c$ on the reversed cycle is precisely a lift accepting $c-k$ on the original cycle, so the first assertion applies. \end{proof} \begin{corollary}\label{cor:unitsteps} For every $k\ge3$, every legal modular step of increment $1,-1,2$ or $-2$ has a direct integer lift. \end{corollary} \begin{proof} For increments $1,2$, Lemma~\ref{lem:interval} excludes a violating cut for \eqref{eq:pos}. Reverse the cycle for increments $-1,-2$. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:short}] If neither direct lift exists, Lemma~\ref{lem:interval} implies $3\le c\le k-3$ and \begin{equation}\label{eq:length} |E(C)|\ge 2\left\lceil\frac{k}{c-2}\right\rceil +2\left\lceil\frac{k}{k-c-2}\right\rceil. \end{equation} Each ceiling is at least two. They cannot both equal two: their denominators would each be at least $k/2$, but those denominators sum to $k-4$. Their sum is therefore at least five, giving length at least ten. For $k=7$, the only remaining increments are $3,4$; the two terms in~\eqref{eq:length} are fourteen and eight, giving length at least twenty-two. \end{proof} \section{The half-modulus step} We treat the half-modulus increment separately before applying the chord induction. \begin{lemma}\label{lem:half} Let $k=2d$ with $d\ge2$. For every legal modular step $f\to f+d\chi_C$, all integer lifts of both endpoints lie in one component of $\Ical_k(G)$. \end{lemma} \begin{proof} Reduce $f$ modulo $d$ to a possibly-zero flow $w$, and let $E_0$ be its zero edges. No edge of $C$ lies in $E_0$, since its value would be $d$ and the proposed step would create zero. By Lemma~\ref{lem:fibres}, choose an integer $d$-lift $W$ of $w$ with exactly the zero set $E_0$. Reverse reference directions outside $E_0$ so that $1\le W\le d-1$. This proof uses these new reference directions, including for $\chi_C$; they need not agree with the traversal of $C$. Call a nowhere-zero $\Z_{2d}$-flow a state if it reduces to $w$ modulo $d$. Every state agrees with $f$ on $E_0$, where the only possible nonzero value is $d$. For any state $h$, the quotient $(h-W)/d$ is a possibly-zero $\Z_2$-flow. Its nonzero support is even, so an Eulerian orientation gives an integer circulation $J$ with values in $\{-1,0,1\}$ and that reduction modulo two. Then $F=W+dJ$ is an integer $2d$-lift of $h$. On $E_0$ it has value $d$ or $-d$; outside $E_0$ it is nonzero modulo $d$ and lies within the required bounds. Let $O$ be a cycle outside $E_0$ directed positively in the chosen reference directions. Then $h-d\chi_O$ is another state, and $F-d\chi_O$ is an integer $2d$-flow: its values on $O$ lie in $[1-2d,d-1]$ and are nonzero modulo $d$. Therefore every such step between states has an adjacent pair of integer lifts. The integer circulation $2W-\chi_C$ is supported outside $E_0$ and strictly positive there, because $2W\ge2$ and $\chi_C\in\{-1,0,1\}$. Decompose it, with multiplicity, into directed cycle vectors positive in the reference orientation. Subtract $d$ on these cycles successively, starting at $f$. All states stay nonzero modulo $d$ outside $E_0$ and unchanged on $E_0$. The total change is $-d(2W-\chi_C)\equiv d\chi_C\pmod{2d}$. Each state step has adjacent integer lifts by the previous paragraph, and connected fibres join these steps into the required path. \end{proof} \section{Chords and component correspondence} \begin{proof}[Proof of Theorem~\ref{thm:smallmod}] For $k=2$ there is at most one nowhere-zero modular flow, and Lemma~\ref{lem:fibres} joins its integer lifts. For $k=3$, the nonzero residues are $1,-1$; for $k=4$, they are $1,-1,2$; and for $k=5$, they are $1,-1,2,-2$. Corollary~\ref{cor:unitsteps} therefore gives two adjacent integer lifts for every modular step in these cases. For $k=6$, it handles $1,-1,2,-2$, while the remaining residue $3=k/2$ is handled by Lemma~\ref{lem:half}. Thus every modular step connects its integer lifting fibres in one component. Lifts exist and fibres are connected by Lemma~\ref{lem:fibres}; conversely integer paths project to modular walks. This gives the component bijection, including empty flow spaces. \end{proof} \begin{lemma}\label{lem:chord} Let $f\to f+c\chi_C$ be a legal modular step, and let $e$ be an edge outside $C$ joining two distinct nonneighboring vertices of $C$. If $2c\ne0$ modulo $k$, the step is a sequence of two legal $c$-steps on strictly shorter cycles. \end{lemma} \begin{proof} Orient the two cycles $C_1,C_2$ formed by the chord so that $\chi_C=\chi_{C_1}+\chi_{C_2}$. In either proposed first step, each old-cycle edge has its initial or final value; the only possible zero is on the chord. Write $s$ for its value in $f$, in either fixed direction along the chord. Its two possible values after the first step are $s+c$ and $s-c$. They cannot both be zero unless $2c=0$. Choose a legal first step; the second reaches the prescribed endpoint. The nonneighbor assumption makes both cycles strictly shorter. \end{proof} \begin{proof}[Proof of Theorem~\ref{thm:main}] For $k=2$ there is at most one nowhere-zero modular flow, and its integer lifts are connected by Lemma~\ref{lem:fibres}. Let $k\ge3$. We prove by induction on the support-cycle length that every modular step has all its integer lifts in one component. The short cycles are covered by Theorem~\ref{thm:short} and the connected fibres of Lemma~\ref{lem:fibres}. A nonzero increment with $2c=0$ is possible only for even $k$, and then $c=k/2$; Lemma~\ref{lem:half} applies. Every other long step has the required nonneighbor chord. Lemma~\ref{lem:chord} expresses it as two shorter steps; induction and the connected fibre at the intermediate modular flow join their integer lifts. This proves the induction. Every modular vertex has integer lifts and every fibre is connected. Every modular edge now connects its two fibres in one integer component. Conversely an integer path projects to a modular walk. These facts give the claimed bijection on components, including empty flow spaces. At $k=7$ use the short-cycle bound twenty-one instead. \end{proof} \section{Statement and definitions} Graphs are finite multigraphs; loops and parallel edges are allowed. A cycle is a connected 2-regular subgraph, including a loop or two parallel edges. Choose a reference direction for every edge. For a cycle $C$ with a direction of traversal, $\chi_C$ is $1$ on edges traversed forward, $-1$ on edges traversed backward, and $0$ elsewhere. The divergence of an edge map is its outgoing sum minus its incoming sum at each vertex. A loop cancels in this difference. A \emph{circulation} has divergence zero at every vertex. For an integer $k\ge2$, an \emph{integer $k$-flow} is an integer circulation $F$ with $1\le |F(e)|\le k-1$ on every edge. The graph $\Fcal(G,k)$ has these flows as vertices; two are adjacent if their difference is $a\chi_C$ for an integer $a\ne0$ and a cycle $C$ with a direction of traversal. Thus both endpoints of a step must be integer $k$-flows. All flows use the same reference directions. These flows are the nowhere-zero $k$-flows of~\cite{EHLMNS}, whose step definition agrees: a circulation supported on one cycle is constant along its traversal. A reconfiguration graph with at most one vertex is regarded as connected; the convention for the empty case agrees with~\cite{EHLMNS}. Write $\delta_G(S)$ for the edges with exactly one endpoint in $S\subseteq V(G)$, and set \[ \mc(G)=\max_{S\subseteq V(G)}|\delta_G(S)|. \] Loops belong to no cut. A graph is \emph{bridgeless} if no edge is a bridge; it need not be connected. A graph is \emph{3-edge-connected} if it is connected, has at least two vertices, and every nonempty proper vertex set has a cut of size at least three. \begin{theorem}\label{l:thm:main} Let $G$ be a finite bridgeless multigraph. For every integer $k\ge\mc(G)+2$, the integer flow reconfiguration graph $\Fcal(G,k)$ is connected. \end{theorem} Esperet et al.~\cite[Theorem~7.1]{EHLMNS} prove connectedness at some modulus for each loopless 2-edge-connected graph $G$; the modulus chosen in their proof is $36|E(G)|(|V(G)|+1)$. Theorem~\ref{l:thm:main} supplies every modulus at or above the stated threshold, and $\mc(G)\le |E(G)|$. The threshold still depends on $G$; it is not a universal constant. \section{Positive orientations and one-edge flips} On a loopless graph, the \emph{positive orientation} $D_F$ of a nowhere-zero real circulation $F$ directs each edge in the direction in which its value is positive. Working with coordinates along an orientation $D$ is just a change of reference directions, not a change in the definition of adjacency. An orientation is \emph{strong} if its directed graph is strongly connected. \begin{lemma}\label{l:lem:positive} For a connected loopless graph, an orientation is strong if and only if it has a real circulation positive on every edge. For every integer $k\ge2$ and every fixed orientation $D$ of a loopless graph $G$, all integer $k$-flows with positive orientation $D$ lie in one component of $\Fcal(G,k)$. \end{lemma} \begin{proof} In a strong orientation every arc lies on a directed cycle. Summing one such cycle vector for every arc gives a positive integer circulation. Conversely, a positive circulation has arcs in both directions across every nonempty cut, by conservation; on a connected graph this implies strong connectivity. Let $F,H$ be integer $k$-flows positive along $D$. Their difference $H-F$ is an integer circulation. Orient its nonzero coordinates positively and decompose it into unit directed cycles, with multiplicity. In the original coordinates these cycle vectors have no cancellation on any edge. Adding them successively to $F$ leaves each edge value between $F(e)$ and $H(e)$, hence in $[1,k-1]$. Every addition is a legal integer step. \end{proof} We use Hoffman's circulation criterion and its integrality assertion \cite[Section~4.5, Theorems~4.6 and~4.7, respectively]{Schrijver}: for integer bounds $\ell(e)\le u(e)$ on every arc of a directed graph, there is an integer circulation $x$ with $\ell\le x\le u$ if and only if, for every vertex set $S$, \begin{equation}\label{l:eq:hoffman} \ell(\delta^-(S))\le u(\delta^+(S)). \end{equation} Here $\delta^-(S)$ and $\delta^+(S)$ are the entering and leaving arcs, respectively, and a map applied to an edge set means its sum on that set. \begin{lemma}[one-edge flip]\label{l:lem:flip} Let $G$ be connected and loopless, and let $D,D'$ be strong orientations differing only on one edge $a$. If $k\ge\mc(G)+2$, then there are adjacent integer $k$-flows whose positive orientations are $D$ and $D'$, respectively. \end{lemma} \begin{proof} Write $a=v\to u$ in $D$, so $a=u\to v$ in $D'$. A simple directed path $P$ from $v$ to $u$ in $D'$ cannot use $a$, whose tail in $D'$ is $u$: a simple path cannot leave its final vertex and later return to it. Thus $P$ is also a directed path in $D-a$. Let $C$ traverse $P$ from $v$ to $u$ and then $a$ from $u$ to $v$. Seek a circulation positive along $D$ with lower bound $1$ on every edge and upper bounds \[ U(a)=1,\qquad U(e)=k-3\ (e\in E(P)),\qquad U(e)=k-1\ (e\notin E(P)\cup\{a\}). \] The existence of two strong orientations differing on $a$ implies that $G$ has at least two vertices and a cycle, so $\mc(G)\ge2$ and $k\ge4$; these bounds are nonempty. For a set $S$ with a nonempty cut, let $i$ and $o$ count the arcs of $D$ entering and leaving $S$. Put $d=i+o=|\delta_G(S)|\le\mc(G)$. Since $D$ is strong, $i,o\ge1$. If $a$ does not leave $S$, then \[ U(\delta^+(S))-i\ge(k-3)o-i=(k-2)o-d\ge k-2-d\ge0. \] If $a$ leaves $S$, then $o\ge2$, because $D'$ is also strong. Hence \[ \begin{split} U(\delta^+(S))-i &\ge1+(k-3)(o-1)-i\\ &=(k-2)(o-1)+2-d\ge k-d\ge0. \end{split} \] Empty cuts satisfy the condition automatically. Thus~\eqref{l:eq:hoffman} supplies an integer circulation $F$ within the displayed bounds. In coordinates along $D$, put $F'=F+2\chi_C$. The value on $a$ changes from $1$ to $-1$; each value on $P$ increases by $2$ and remains in $[3,k-1]$; all others stay unchanged. Thus both maps are integer $k$-flows, their difference is one cycle step, and the positive orientation of $F'$ is exactly $D'$. \end{proof} \section{Connecting the orientations} \begin{lemma}\label{l:lem:chambers} In a loopless 3-edge-connected graph with at least two vertices, any two strong orientations are joined by a sequence of strong orientations in which consecutive orientations differ on a single edge. \end{lemma} \begin{proof} Fix reference directions and let $Z\subseteq\R^{E(G)}$ be the vector space of real circulations. For each edge $e$ put $H_e=\{z\in Z:z(e)=0\}$. Because $e$ lies on a cycle, $H_e$ is a proper hyperplane of $Z$. For distinct edges $e,f$, the graph $G-f$ is bridgeless: a bridge there would give a cut of size at most two in $G$. Thus $G-f$ has a cycle through $e$. Its vector is in $H_f$ but not $H_e$, so these hyperplanes are distinct. The nonempty sign regions of $Z\setminus\bigcup_e H_e$ correspond exactly to strong orientations, by Lemma~\ref{l:lem:positive}. Each region is an open convex cone in $Z$. Choose a point in each of two prescribed regions. Perturb the first point within its region so that the segment to the second point avoids every intersection $H_e\cap H_f$, $e\ne f$. This is possible because each such intersection has codimension two: the first endpoints whose segment meets it lie in a proper linear subspace spanned by that intersection and the second point. A finite union of proper subspaces cannot cover an open region. The segment now crosses the hyperplanes one at a time. At each crossing only one coordinate sign changes, giving the desired sequence of orientations. \end{proof} \begin{proof}[Theorem~\ref{l:thm:main} for loopless 3-edge-connected graphs] Take any two integer $k$-flows $F,H$. Their positive orientations are strong by Lemma~\ref{l:lem:positive}. Join the orientations by Lemma~\ref{l:lem:chambers}. At each one-edge flip, Lemma~\ref{l:lem:flip} supplies adjacent integer flows with the two prescribed orientations. Lemma~\ref{l:lem:positive} joins any chosen representatives within an intervening orientation, as well as the first and last representatives to $F,H$. Concatenating these paths joins $F$ to $H$. \end{proof} \section{Loops and two-edge cuts} \begin{lemma}\label{l:lem:two-cut} Let $G$ be connected and bridgeless, and suppose $\delta_G(S)=\{e,f\}$. For every $k\ge2$, restriction to the remaining edges after contracting $e$ gives an isomorphism $\Fcal(G,k)\cong\Fcal(G/e,k)$. \end{lemma} \begin{proof} The edge $e$ is not a loop. A circulation of $G/e$ extends uniquely to a circulation of $G$: choose the value on $e$ to restore conservation at one original endpoint, after which conservation at the other follows from that at the contracted vertex. Summing conservation over $S$ shows that the value on $e$ equals the value on $f$, up to the fixed sign of their reference directions. Thus the extension is nonzero and has the required absolute bound on $e$. This proves a bijection of integer $k$-flows. A cycle of $G$ uses either both cut edges or neither, since it crosses any cut an even number of times. If it avoids them, it lies on one side of the cut and remains a cycle after contraction. If it uses them, contracting $e$ shortens it to a cycle, possibly a loop when the cycle consists of $e,f$. Conversely, in $(G/e)-f$ the identified vertex is the only possible meeting point of the two original sides. A simple cycle avoiding $f$ cannot visit that vertex twice, so it stays on one side and lifts to a cycle avoiding $e$. A cycle using $f$ must return through that vertex; splitting the vertex and inserting $e$ gives a cycle of $G$. These correspondences are inverse. They preserve each cycle-step coefficient: in the reverse direction, the cycle vector of the lifted cycle is the unique extension of the cycle vector in $G/e$. By linearity and uniqueness, the difference of the extended flows has this same coefficient. Hence the flow bijection preserves adjacency in both directions. \end{proof} \begin{proof}[Completion of the proof of Theorem~\ref{l:thm:main}] First suppose $G$ is connected. A loop has an independent nonzero integer value in $\{-(k-1),\ldots,-1,1,\ldots,k-1\}$. Any two such values are joined by one loop step, so deleting a loop removes a nonempty complete-graph factor from the Cartesian product description of $\Fcal(G,k)$. Repeatedly delete loops and contract one edge of a two-edge cut. Both operations preserve connectedness. Deleting a loop changes no cut; every cut after an edge contraction lifts to a cut of the same size before contraction, keeping the two endpoints of the contracted edge on the same side. Thus neither operation creates a bridge or increases $\mc$. Each operation decreases the number of edges, so the process terminates at a connected loopless graph $G_0$ with no cut of size one or two. It has one vertex and no edge, or is 3-edge-connected; also $\mc(G_0)\le\mc(G)$. If $G_0$ has no edge, its reconfiguration graph has one vertex. Otherwise the case just proved applies, since $k\ge\mc(G)+2\ge\mc(G_0)+2$. Transfer connectedness back through Lemma~\ref{l:lem:two-cut} and the loop factors. Finally, for a graph with several connected components, the reconfiguration graph is the Cartesian product of their reconfiguration graphs, since every cycle lies in one component. Each component has maximum cut at most $\mc(G)$, so the connected case applies to every factor. An empty factor makes the whole graph empty, which is connected by our convention; otherwise a finite product of connected graphs is connected. \end{proof} \begin{remark} A bridge has value zero in every circulation, by conservation across its cut. Thus a graph with a bridge has no nowhere-zero integer flow, and its reconfiguration graph is empty. The same connectivity conclusion therefore holds trivially for all finite multigraphs under the convention stated above. \end{remark} \section{Scaling modular components} A nowhere-zero $\Z_k$-flow is an edge map with nonzero values and divergence zero in $\Z_k$. Its reconfiguration graph $\Fcal(G,\Z_k)$ uses the same cycle-step definition, with increments in $\Z_k\setminus\{0\}$. An integer lift of such a flow is an integer $k$-flow with the same values modulo $k$. \begin{theorem}\label{l:thm:scaling} Let $G$ be any finite multigraph, and let $k,m\ge2$ be integers. Suppose $f,f'$ lie in one component of $\Fcal(G,\Z_k)$, and $F,F'$ are integer $k$-lifts of $f,f'$, respectively. Then $mF$ and $mF'$ lie in one component of $\Fcal(G,mk)$. \end{theorem} This statement concerns the scaled original flows. It does not assert connectedness of all integer $mk$-flows, or connectedness of the original lifts at modulus $k$. We give the lifting details used in its proof. \begin{lemma}\label{l:lem:round} If $x:E(G)\to[0,1]$ has integral divergence, there is a map $z:E(G)\to\{0,1\}$ with the same divergence, agreeing with $x$ on all its integral coordinates. \end{lemma} \begin{proof} If a fractional edge is a loop, it is already a cycle. Otherwise every vertex incident with a fractional edge has at least two fractional edge ends: exactly one would contradict integral divergence. Thus, whenever fractional edges remain, they contain a cycle. Choose a direction on a cycle of fractional edges and add a positive multiple of its cycle vector until some coordinate becomes integral, keeping all coordinates in $[0,1]$. No already integral coordinate changes. Repetition proves the claim. \end{proof} \begin{lemma}\label{l:lem:fibres} Every nowhere-zero $\Z_K$-flow has an integer $K$-lift, and all its integer $K$-lifts lie in one component of $\Fcal(G,K)$, for every $K\ge2$. \end{lemma} \begin{proof} Represent the residues by $r(e)\in\{1,\ldots,K-1\}$. The map $r/K$ has integral divergence. Round it to $z$ by Lemma~\ref{l:lem:round}; then $r-Kz$ is an integer circulation, with every value either $r(e)$ or $r(e)-K$, and is an integer $K$-lift. For two such lifts $H,H'$, the map $(H'-H)/K$ is a circulation with values in $\{-1,0,1\}$. Direct its nonzero edges positively and decompose them into edge-disjoint directed cycles. Adding $K$ on these cycles successively gives only old or final edge values at each stage, so all intermediate maps are integer $K$-flows. \end{proof} \begin{lemma}\label{l:lem:smallsteps} For $K\ge3$, every legal modular step with increment $1$ or $2$ has a pair of adjacent integer $K$-lifts, one at each endpoint. \end{lemma} \begin{proof} Choose reference directions along its cycle $C$, and write the initial residues as $r(e)\in\{1,\ldots,K-1\}$. For increment $1$, legality excludes $r(e)=K-1$ on $C$. Either representative $r(e)$ or $r(e)-K$ therefore remains nonzero and within the integer $K$-flow bounds after adding $1$. Thus every integer lift accepts this step, and such a lift exists by Lemma~\ref{l:lem:fibres}. For increment $2$, legality excludes $r(e)=K-2$ on $C$. Apply Lemma~\ref{l:lem:round} to $x=(r+\chi_C)/K$, which lies in $[0,1]^{E(G)}$ and has integral divergence. The rounded map $z$ has the same divergence as $r/K$ and has $z(e)=1$ wherever $e\in E(C)$ and $r(e)=K-1$. Thus $H=r-Kz$ is an integer $K$-lift with value $-1$ on those edges. Adding $2$ changes them to $1$. Every other cycle residue is at most $K-3$; either of its representatives remains nonzero and within the bounds after adding $2$. Consequently $H+2\chi_C$ is the required adjacent integer lift. \end{proof} \begin{proof}[Proof of Theorem~\ref{l:thm:scaling}] Multiplication by $m$ gives an injective homomorphism $\Z_k\to\Z_{mk}$, so $mf$ is nowhere zero. The integer flow $mF$ is an integer $mk$-lift of it, since $m|F(e)|\le m(k-1)0$ for every $e\in\supp(u)$. \begin{lemma}\label{r:lem:decompose} Every circuit vector of a totally unimodular matrix has nonzero coordinates in $\{-1,1\}$. Every integer vector $Y\in\ker A$ is a sum of circuit vectors, all supported on $\supp(Y)$ and conformal to $Y$. \end{lemma} \begin{proof} The kernel restricted to a circuit support is one-dimensional: two independent vectors on that support could be linearly combined to cancel one coordinate without cancelling them all, contrary to minimality. Thus on a circuit support of size $s$, the columns have rank $s-1$. Choose $s-1$ independent rows of this restricted matrix. Every remaining row is a linear combination of them, so their kernel is the kernel of the full restricted matrix. The cofactor formula gives a nonzero kernel vector whose coordinates are its signed maximal minors. Minimality of the circuit implies that none of these coordinates vanishes. Total unimodularity therefore makes them all $1$ or $-1$. For a singleton circuit the column is zero and the assertion is immediate. For the decomposition, restrict to $\supp(Y)$ and reorient so that $Y$ is positive there. Choose a nonzero nonnegative real kernel vector with minimal support. Its support is a circuit: otherwise a kernel direction on a proper subset of that support could be added or subtracted until a coordinate vanishes, leaving a nonzero nonnegative vector of smaller support. The corresponding positive circuit vector has value $1$ on its support. Subtract it from $Y$. The result is nonnegative and integral, and its coordinate sum strictly decreases. Repetition terminates at zero. \end{proof} \begin{lemma}[Lifts and fibres]\label{r:lem:fibres} Every modular $k$-flow has an integer $k$-lift, and all its integer lifts are in one component of $\Ical_k(A)$. More generally a possibly-zero modular kernel vector has an integer lift of absolute values at most $k-1$ with exactly the same zero coordinates. \end{lemma} \begin{proof} Choose residues $r_e\in\{0,\ldots,k-1\}$. Then $Ar/k$ is integral. Round $r/k$ to a binary vector $z$ by Lemma~\ref{r:lem:round} and put $F=r-kz$. This has $AF=0$. A zero residue forces $z_e=0$, whereas a nonzero residue gives $F_e=r_e$ or $r_e-k$, both nonzero and within the bound. For two lifts $F,F'$ of a nowhere-zero modular vector, $(F'-F)/k$ is a kernel vector with coordinates in $\{-1,0,1\}$. Its conformal decomposition from Lemma~\ref{r:lem:decompose} consists of circuit vectors with disjoint supports. Adding $k$ times these vectors successively changes each coordinate once from its old value to its final value. Every intermediate vector is an integer $k$-flow. \end{proof} \section{Small steps and half-modulus steps} \begin{lemma}\label{r:lem:two} For $k\ge3$, the two endpoints of every legal modular step of increment $1,-1,2$, or $-2$ have adjacent integer lifts. \end{lemma} \begin{proof} Reorient so that its circuit vector $\gamma$ is $1$ on its support $C$, and choose residues $r_e\in\{1,\ldots,k-1\}$. For increment $1$, legality excludes $r_e=k-1$ on $C$. Both possible integer representatives $r_e,r_e-k$ then accept the increment without becoming zero or exceeding the bound. Any integer lift works. For increment $2$, let $x=(r+\gamma)/k$. This belongs to $[0,1]^E$ and $Ax=Ar/k$ is integral. Round it to binary $z$ and set $F=r-kz$. If $e\in C$ has $r_e=k-1$, then $x_e=1$, so $z_e=1$; the step changes $F_e=-1$ to $1$. Legality excludes residue $k-2$ on $C$. On every remaining coordinate of $C$, $r_e\le k-3$, and either integer representative accepts $+2$. Thus $F,F+2\gamma$ are adjacent integer lifts. Reverse the circuit vector for the negative increments. \end{proof} \begin{lemma}\label{r:lem:half} Let $k=2d$ with $d\ge2$. For every legal modular step $f\to f+d\gamma$, all integer lifts of its two endpoints belong to one component of $\Ical_{2d}(A)$. \end{lemma} \begin{proof} Let $w=f\pmod d$ and let $E_0$ be its zero coordinates. Choose an integer $d$-lift $W$ with exactly that zero set by Lemma~\ref{r:lem:fibres}. No coordinate of $\supp(\gamma)$ lies in $E_0$: there the only nonzero value of $f$ could be $d$, and the proposed step would make it zero. Reorient outside $E_0$ so $1\le W_e\le d-1$ there. Call a nowhere-zero modular $2d$-flow $g$ a state if it reduces to $w$ modulo $d$. On $E_0$ each state has value $d$, so agrees with $f$. For an integer representative $\widetilde g$, write $\widetilde g-W=dq$. Then $dAq\equiv0\pmod{2d}$, so $Aq\equiv0\pmod2$; changing the representative changes $q$ by an even vector. Thus $(g-W)/d$ is a well-defined modular $2$-kernel vector. Lift it to an integer kernel vector $J\in\{-1,0,1\}^E$, preserving its zero coordinates. Then $F=W+dJ$ is an integer $2d$-lift of $g$. On $E_0$ it has value $d$ or $-d$; elsewhere it is nonzero modulo $d$ and lies in $[1-d,2d-1]$. Let $\eta$ be a circuit vector supported outside $E_0$ and positive in this orientation. Then $g-d\eta$ is another state. The lift $F$ above accepts $-d\eta$: its affected values afterward lie in $[1-2d,d-1]$ and remain nonzero modulo $d$. Thus every such state step has adjacent integer lifts. The integer kernel vector $Y=2W-\gamma$ vanishes on $E_0$ and is strictly positive elsewhere, since $W_e\ge1$ and $\gamma_e\in\{-1,0,1\}$. Decompose $Y$ into positive circuit vectors by Lemma~\ref{r:lem:decompose}. Starting at $f$, subtract $d$ on these circuits successively. All states stay legal, and the total change is \[ -dY=-2dW+d\gamma\equiv d\gamma\pmod{2d}. \] Each state step has adjacent integer lifts; connected fibres concatenate them into a path between the endpoint fibres. \end{proof} \begin{proof}[Proof of Theorem~\ref{r:thm:small}] At $k=2$ there is at most one nowhere-zero modular vector, and its fibre is connected. At $k=3,4,5$ every nonzero increment is among $\pm1,\pm2$, so Lemma~\ref{r:lem:two} handles every legal modular edge. At $k=6$ it handles $1,2,4,5$, while Lemma~\ref{r:lem:half} handles $3$. Thus every modular vertex has a lift, every fibre is connected, and every modular edge joins its two fibres in one integer component. Conversely, integer paths reduce to modular walks. These facts give the component bijection, also when the flow spaces are empty. \end{proof} \section{Tensions as totally unimodular kernels} For a connected loopless graph $H$, an integer tension is the vector of oriented differences of an integer vertex potential, taken up to a constant. The modular definition uses vertex potentials in $\Z_k$. A nowhere-zero modular tension is therefore a proper $k$-colouring up to a constant. The integer bound requires all edge differences to have absolute values in $\{1,\ldots,k-1\}$. \begin{lemma}\label{r:lem:tensions} The integer and modular tension spaces of a connected loopless graph with at least two vertices are kernels of one totally unimodular integer matrix. Their circuit steps are exactly shifts by a constant on one side of a bond. \end{lemma} \begin{proof} Let $D$ be the oriented incidence matrix of $H$ with one row deleted, and partition its columns into a spanning tree $\mathcal T$ and the remaining edges $\mathcal N$. The square matrix $D_{\mathcal T}$ has determinant $\pm1$, by leaf elimination. Put $B=D_{\mathcal T}^{-1}D_{\mathcal N}$. An edge vector $v$ is a tension exactly when $v_{\mathcal N}=B^T v_{\mathcal T}$, over both the integers and $\Z_k$, because $D_{\mathcal T}^{-1}$ is integral. Hence the tension matrix is $[-B^T\ I]$. The incidence matrix is totally unimodular: in any square submatrix a column with at most one nonzero permits determinant expansion, while if every column has two nonzeros their signs are opposite and the row sum is zero. For equally sized row and column index sets $I,J$ of $B$, replace the tree columns in positions $I$ of $D_{\mathcal T}$ by the columns of $D_{\mathcal N}$ indexed by $J$, obtaining $R$. The matrix $D_{\mathcal T}^{-1}R$ is an identity matrix with those columns replaced by columns of $B$. Expanding along its unchanged identity columns gives $\det R/\det D_{\mathcal T}=\pm\det B[I,J]$. Since $R$ consists of columns of $D$, this determinant is $0$ or $\pm1$. Thus $B$ is totally unimodular; transposition and adjoining identity columns show the same for $[-B^T\ I]$. The minimal nonzero tension supports are bonds. Indeed, a nonconstant real potential has a nonempty level cut contained in its tension support, so minimal support must be a minimal nonempty cut. In a connected graph a nonempty cut is inclusion-minimal exactly when both induced sides are connected; such a cut is a bond. Conversely, when both sides of a cut are connected, any potential with differences supported on that cut is constant on each side. Its primitive tension vector is the signed indicator of the bond. Its scalar multiples shift one side by a constant. \end{proof} \section{Failure at each prime from seven on} \begin{proof}[Proof of Theorem~\ref{r:thm:failure}] Fix a prime $p\ge7$. Let $S=\{s_i:i\in\Z_p\}$ and $T=\{t_i:i\in\Z_p\}$ each induce a complete graph. Insert a cross edge $s_it_j$ exactly when $1-j+i\notin\{0,3\}$ modulo $p$. This defines a connected simple graph $H_p$ with $2p$ vertices and $p(p-1)+p(p-2)=2p^2-3p$ edges. By Lemma~\ref{r:lem:tensions} its tension space has a totally unimodular kernel representation $A$. Define colours $c(s_i)=-i$ and $c(t_j)=1-j$ in $\Z_p$. The cross-edge differences $c(t_j)-c(s_i)$ exhaust all residues except $0$ and $3$. Consequently $c$ and $c'=c+3\mathbf1_S$ are proper colourings, and shifting $S$ by $3$ is a legal bond move. We first show that their modular tension component has exactly two vertices. In any proper colouring of a $K_p$ block, the colours exhaust $\Z_p$. Suppose a legal move by $a\ne0$ modulo $p$ shifts a subset of that block whose colour set is $U$. Avoiding collisions with unchanged vertices requires $U+a\subseteq U$, hence $U+a=U$. Primality implies $U$ is empty or all of $\Z_p$. Thus each block is shifted wholly or not at all. Modulo a global constant, every nontrivial move shifts $S$ only. Relative to $c$, such a shift is proper only at offsets $0$ and $3$. These are distinct tensions, so the component is exactly $\{c,c'\}$. We show that no integer move joins a lift of $c$ to a lift of $c'$. Its reduction is a nontrivial modular move, since $c\ne c'$. An integer bond step and its nontrivial reduction have exactly the same support. The block argument therefore makes its side $S$ or $T$. Shifting $T$ by an integer is, up to a global constant, shifting $S$ by its negative. Thus the move shifts $S$ by an integer $b\equiv3\pmod p$. A crossing edge changes its difference by $b$; both endpoint differences have absolute value at most $p-1$, so $|b|\le2p-2$. Therefore \[ b\in\{3,\ 3-p,\ 3+p,\ 3-2p\}. \] For a lift with vertex heights $h$, an initial cross difference of residue $\rho\in\{1,\ldots,p-1\}\setminus\{3\}$ is $\rho$ or $\rho-p$; after the move it decreases by $b$. If $b=3$, the edges of residues $1$ and $2$ must use their positive representatives. Thus \[ h(t_i)=h(s_i)+1,\qquad h(t_{i-1})=h(s_i)+2, \] giving $h(t_{i-1})=h(t_i)+1$ for every index. Summing around $\Z_p$ is impossible. If $b=3-p$, edges of residues $4$ and $5$ must use their negative representatives. Both classes exist because $p\ge7$. They give \[ h(t_{i-3})=h(s_i)+4-p,\qquad h(t_{i-4})=h(s_i)+5-p. \] Again successive $t$-heights increase by $1$ cyclically, a contradiction. If $b=3+p$, every initial cross difference would have to be at least $4$; a residue-$1$ edge cannot have that value. If $b=3-2p$, every initial cross difference would have to be at most $2-p$; a residue-$(p-1)$ edge, whose possibilities are $p-1$ and $-1$, cannot have that value. This excludes all four shifts. Both modular tensions have integer lifts: choose their height representatives in $\{0,\ldots,p-1\}$. Any integer path between the fibres would reduce to a modular walk inside $\{c,c'\}$ and would contain a first step crossing between these fibres, which has just been excluded. Hence the component map is not injective. \end{proof} \begin{remark}[Scope of the obstruction] The modular tension graph in this example is not connected as a whole. For example, negate all the colours of $c$. The differences inside either clique are then negated and are not those of $c$ or $c'$, since $p$ is odd. This gives a modular tension outside their two-vertex component. Thus the example does not disprove the weaker assertion that modular connectedness implies integer connectedness for tensions. It does show that a universal proof of the stronger component correspondence at $7$ cannot apply to every totally unimodular kernel. These examples are not graphic: $H_p$ contains $K_5$, so its cycle matroid has an $M(K_5)$ minor and is not cographic by~\cite[Corollary~10.3.5]{Oxley}; equivalently, its bond matroid is not graphic. A proof for graphic flows by the stronger component-correspondence route must exclude these examples. Theorems~\ref{r:thm:small} and~\ref{r:thm:failure} give correspondence through six and failure at every prime from seven on. In particular, six is the largest endpoint of a universal initial interval of moduli; no claim is made about all composite moduli above six. \end{remark} \section{Liftable steps: the tools from the companion paper}\label{p1:sec:tools} The proof of Theorem~\ref{t2c:thm:main} uses four statements of Section~1 of~\cite{GoelOneModulus}, with their numbers there: the definition of a liftable step \cite[Definition~1.7]{GoelOneModulus}, the lemma on liftable steps \cite[Lemma~1.12]{GoelOneModulus}, the multiplier lemma \cite[Lemma~1.11]{GoelOneModulus} and the divisor extension \cite[Theorem~1.5]{GoelOneModulus}. Part~(d) of that Lemma~1.12 rests on its Lemma~1.10, and its part~(e) rests on its Lemma~1.11 and so on its Theorem~1.5. The proofs are in \cite[Section~1]{GoelOneModulus}, which states its own definitions. Its words agree with those of Section~2: a \emph{move} there is a step here, and $\Mcal_k(G)$ and $\Ical_k(G)$ are the two graphs of flows of this paper; its boundary is the negative of the divergence of Section~2, and the flows are the same. Its Corollary~1.3 is the lifting theorem of Tutte in the form of \cite[Theorem~2.3]{EHLMNS}, and its Lemma~1.4 is \cite[Lemma~5.5]{EHLMNS}. Sections~\ref{t2c:sec:statement} to~\ref{t2c:sec:proofs} quote the definition and the lemma in their own words. \iffalse \subsection*{Graphs, flows and the reconfiguration graphs}\label{a1:conventions} Graphs are finite multigraphs. Loops are allowed, unless the graph is called loopless. A \emph{cycle} is a connected subgraph in which every vertex has degree~$2$; a loop is a cycle of length~$1$, and two parallel edges form a cycle of length~$2$. An edge that lies on no cycle is a \emph{bridge}; a graph is \emph{bridgeless} if it has no bridge, that is, if every edge lies on a cycle. A graph without edges is bridgeless. A multigraph is \emph{$j$-edge-connected} if, for every partition of its vertex set into two non-empty sets, at least $j$ edges have one end in each set. Every graph has a fixed reference orientation: every edge has a tail and a head \textup{(}for a loop they are the same vertex\textup{)}. Let $x$ be a map from $E(G)$ to an abelian group. Its \emph{boundary} at a vertex $v$ is \[ (\partial x)(v)\;=\sum_{e\,:\,v\text{ is the head of }e}x(e)\;-\sum_{e\,:\,v\text{ is the tail of }e}x(e). \] A loop at $v$ is in both sums, so it adds nothing. The map $x$ is a \emph{flow} if $\partial x=0$ \textup{(}conservation at every vertex\textup{)}. An \emph{integer flow} is a flow with values in $\Z$. Groups are finite abelian groups, if nothing else is said. For a group $\Gam$, a \emph{$\Gam$-flow} of $G$ is a flow $E(G)\to\Gam$; it is \emph{nowhere zero} if no value is $0$. The \emph{support} $\supp(x)$ is the set of the edges $e$ with $x(e)\ne 0$. For a cycle $C$ with a direction, $\chi_C$ is its signed indicator: $\chi_C(e)=1$ if $C$ passes the edge $e$ from the tail to the head \textup{(}\emph{forward}\textup{)}, $\chi_C(e)=-1$ if $C$ passes $e$ from the head to the tail, and $\chi_C(e)=0$ if $e$ is not on $C$. So $\chi_C$ is an integer flow, and $\lambda\chi_C$ is a $\Gam$-flow for every $\lambda$ in $\Gam$. If the reference orientation of one edge is reversed and the value of every flow on this edge is replaced by its negative, then flows stay flows, and nothing else changes. No statement of this section depends on the reference orientation, and we change it freely inside proofs. $\Fl(G,\Gam)$ is the graph on the nowhere-zero $\Gam$-flows of $G$; two flows are adjacent if their difference is $\lambda\chi_C$ for a cycle $C$ of $G$ and $\lambda\ne 0$ \textup{(}a \emph{move}\textup{)}. $\Mk(G)=\Fl(G,\Z_k)$. $\Ik(G)$ is the graph on the integer flows $F$ of $G$ with $1\le|F(e)|\le k-1$ for every edge $e$; two of them are adjacent if their difference is $\lambda\chi_C$ with an integer $\lambda\ne 0$. An \emph{integer lift} of a $\Z_k$-flow $f$ is a vertex $F$ of $\Ik(G)$ with $F=f$ modulo $k$. These are the three \emph{reconfiguration graphs}. In each of the three graphs, two different vertices are adjacent if and only if the support of their difference is the edge set of a cycle: a flow whose support is a cycle $C$ has, by conservation at the vertices of $C$, the form $\lambda\chi_C$. A graph $G$ without edges has exactly one flow, the empty map; it is a vertex of each of the three reconfiguration graphs. A reconfiguration graph that has no vertex counts as connected. In this section $G$ is a finite multigraph, and loops are allowed. Only Definition~\ref{p1:def:liftable} and Lemma~\ref{p1:lem:liftable} speak of loopless graphs. \subsection*{The cycle decomposition}\label{a1:cycledec-sec} \begin{lemma}[Cycle decomposition]\label{p1:lem:cycledec}\label{a1:cycledec} Let $G$ be a multigraph. \begin{condlist}{(a)} \item[\textup{(a)}] Let $A$ be an abelian group, finite or not, and let $T_0$ be a spanning forest of $G$ \textup{(}a spanning tree in every component of $G$\textup{)}. For an edge $e$ outside $T_0$ let $C_e$ be the fundamental cycle of $e$ in $T_0$, directed along $e$. Then every $A$-flow $h$ of $G$ is \[ h=\sum_{e\notin E(T_0)}h(e)\,\chi_{C_e}, \] and this is the only way to write $h$ as a sum $\sum_{e\notin E(T_0)}x_e\chi_{C_e}$ with $x_e$ in $A$. In particular every $A$-flow of $G$ is a sum of flows $x\chi_C$ with $x$ in $A$ and $C$ a cycle of $G$. \item[\textup{(b)}] \textup{(}The signed form.\textup{)} Every integer flow $h$ of $G$ is a sum \[ h=\chi_{O_1}+\dots+\chi_{O_j}\qquad(j\ge 0) \] of signed indicators of directed cycles $O_1,\dots,O_j$ of $G$ \textup{(}a cycle can occur several times\textup{)}, such that every $O_i$ passes each of its edges in the direction of the sign of $h$: $\chi_{O_i}(e)\,h(e)>0$ for every edge $e$ of $O_i$. Hence, for every edge $e$: exactly $|h(e)|$ of the cycles contain $e$; every sum of some of the numbers $\chi_{O_1}(e),\dots,\chi_{O_j}(e)$ lies between $0$ and $h(e)$; and all cycles lie in $\supp(h)$. If all values of $h$ are in $\{-1,0,1\}$, then $O_1,\dots,O_j$ are pairwise edge-disjoint. \end{condlist} \end{lemma} \begin{proof} (a) Put $h'=h-\sum_{e\notin E(T_0)}h(e)\chi_{C_e}$. This is an $A$-flow. The cycle $C_e$ contains $e$ and no other edge outside $T_0$, and $\chi_{C_e}(e)=1$. \textup{(}A loop is not in $T_0$, and it is its own fundamental cycle.\textup{)} So $h'$ is $0$ on every edge outside $T_0$. Suppose that $h'\ne 0$. The edges with $h'\ne 0$ form a forest with at least one edge. It has a vertex that meets exactly one of these edges. Conservation at this vertex says that the value of $h'$ on this edge is $0$, a contradiction. So $h'=0$. The sum $\sum x_e\chi_{C_e}$ has the value $x_e$ on the edge $e$ outside $T_0$; so the coefficients are determined by the flow. (b) Induction on $\sum_e|h(e)|$. If this sum is $0$, take $j=0$. Otherwise reverse the reference orientation of every edge $e$ with $h(e)<0$; now $h\ge 0$. If a loop has a positive value, let $O$ be this loop, passed forward. Otherwise use conservation: at every vertex, the sum of $h$ over the edges that enter is equal to the sum over the edges that leave \textup{(}loops are left out on both sides\textup{)}. So the head of an edge with a positive value is the tail of an edge with a positive value. Start with an edge with a positive value and go on in this way. The walk does not end, so it comes back to a vertex that it has seen. This gives a directed cycle $O$ that passes all its edges forward, and $h>0$ on all its edges. Now $h-\chi_O$ is an integer flow with $h-\chi_O\ge 0$ and with a smaller sum. By induction it is a sum of signed indicators of directed cycles that pass their edges forward. Add $\chi_O$. In the first reference orientation, ``forward'' is the direction of the sign of $h(e)$. For a fixed edge $e$, all non-zero numbers $\chi_{O_i}(e)$ have the sign of $h(e)$, and their sum is $h(e)$. This gives the three consequences. If $|h(e)|\le 1$ for all $e$, every edge is on at most one of the cycles. \end{proof} \subsection*{Rounding, integer lifts, and the fibres}\label{a1:lifting-sec} \begin{lemma}[Rounding]\label{p1:lem:rounding}\label{a1:rounding} Let $x$ be a map from $E(G)$ to the real interval $[0,1]$ such that $(\partial x)(v)$ is an integer for every vertex $v$. Then there is a map $z\colon E(G)\to\{0,1\}$ with $\partial z=\partial x$ and with $z(e)=x(e)$ for every edge $e$ with $x(e)$ in $\{0,1\}$. \end{lemma} \begin{proof} Call an edge $e$ fractional if $00$ be the least number such that $x+\delta\chi_C$ has the value $0$ or $1$ on some edge of $C$; it exists, because all values of $x$ on $C$ are strictly between $0$ and $1$. The map $x+\delta\chi_C$ has values in $[0,1]$ and the same boundary as $x$, because $\partial\chi_C=0$. The values on the edges that are not fractional have not changed, and the number of fractional edges is smaller. Repeat this until no edge is fractional. \end{proof} \begin{corollary}[Integer lifts]\label{p1:cor:lifting}\label{a1:lifting} Let $k\ge 2$ and let $f$ be a $\Z_k$-flow of $G$; zeros are allowed. Then there is an integer flow $F$ of $G$ with $F=f$ modulo $k$, with $|F(e)|\le k-1$ for every edge $e$, and with $F(e)=0$ exactly for the edges $e$ with $f(e)=0$. In particular every nowhere-zero $\Z_k$-flow of $G$ has an integer lift. \end{corollary} \begin{proof} For every edge $e$ let $r(e)$ in $\{0,\dots,k-1\}$ be the residue of $f(e)$. Then $\partial r=\partial f=0$ modulo $k$, so the map $x=r/k$ has values in $[0,1)$ and an integer boundary. Lemma~\ref{p1:lem:rounding} gives $z\colon E(G)\to\{0,1\}$ with $\partial z=\partial x$ and with $z(e)=0$ if $r(e)=0$. Put $F=r-kz$. Then $\partial F=\partial r-k\,\partial x=0$, and $F=f$ modulo $k$. If $r(e)=0$, then $F(e)=0$. If $r(e)\ne 0$, then $F(e)$ is $r(e)$ or $r(e)-k$; the first number is in $[1,k-1]$ and the second one is in $[-(k-1),-1]$. \end{proof} Corollary~\ref{p1:cor:lifting} is Tutte's lifting theorem in the form of \cite[Theorem~2.3]{EHLMNS}. \begin{lemma}[Connected fibres]\label{p1:lem:fibres}\label{a1:fibres} Let $k\ge 2$ and let $f$ be a nowhere-zero $\Z_k$-flow of $G$. Then the integer lifts of $f$ induce a connected subgraph of $\Ik(G)$. \end{lemma} \begin{proof} Let $F$ and $F'$ be integer lifts of $f$. On every edge $e$, both $F(e)$ and $F'(e)$ are in $\{r(e),\,r(e)-k\}$, where $r(e)$ in $\{1,\dots,k-1\}$ is the residue of $f(e)$. So $h=(F'-F)/k$ is an integer flow with values in $\{-1,0,1\}$. By Lemma~\ref{p1:lem:cycledec}~(b), $h=\chi_{O_1}+\dots+\chi_{O_j}$ with pairwise edge-disjoint directed cycles. Put $F_i=F+k\,(\chi_{O_1}+\dots+\chi_{O_i})$. On every edge, $F_i$ has the value of $F$ or the value of $F'$. So every $F_i$ is an integer lift of $f$, $F_0=F$, $F_j=F'$, and $F_i-F_{i-1}=k\chi_{O_i}$. This is a path from $F$ to $F'$ in $\Ik(G)$ through integer lifts of $f$. \end{proof} Lemma~\ref{p1:lem:fibres} is \cite[Lemma~5.5]{EHLMNS}. \subsection*{The divisor extension}\label{a1:divext-sec} Let $k=mq$ with integers $m,q\ge 2$. Reduction modulo $q$ is a homomorphism from $\Z_k$ onto $\Z_q$; so the \emph{reduction modulo $q$} of a $\Z_k$-flow, taken edge by edge, is a $\Z_q$-flow. The multiples of $q$ in $\Z_k$ form the subgroup $q\Z_k$, and $qj\mapsto j$ modulo $m$ is an isomorphism from $q\Z_k$ onto $\Z_m$. For a $\Z_k$-flow $y$ with all values in $q\Z_k$ we write $y/q$ for its image, a $\Z_m$-flow. The next two proofs use the same setting. \smallskip \noindent\textbf{Setting.} $w$ is a $\Z_q$-flow of $G$, and $E_0$ is the set of the edges $e$ with $w(e)=0$. By Corollary~\ref{p1:cor:lifting} there is an integer flow $W$ of $G$ with $W=w$ modulo $q$, with $|W(e)|\le q-1$, and with $W(e)=0$ exactly on $E_0$. Reverse the reference orientation of every edge with $W(e)<0$. So from now on \[ 1\le W(e)\le q-1\quad\text{for every edge }e\notin E_0,\qquad W(e)=0\quad\text{for every edge }e\in E_0. \] A \emph{state} is a nowhere-zero $\Z_k$-flow of $G$ whose reduction modulo $q$ is $w$. \smallskip \noindent\textbf{Claim 1} \textup{(}the standard lift of a state\textup{)}. \emph{For every state $h$ there is an integer flow $L$ of $G$ with $|L(e)|\le m-1$ for every edge $e$, such that $F=W+qL$ is an integer lift of $h$. For every edge $e$ in $E_0$: $L(e)\ne 0$, and $h(e)=qL(e)$ modulo $k$.} \smallskip \noindent\emph{Proof.} The $\Z_k$-flow $h-W$ has the reduction $0$ modulo $q$, so all its values are in $q\Z_k$, and $y=(h-W)/q$ is a $\Z_m$-flow. By Corollary~\ref{p1:cor:lifting} there is an integer flow $L$ with $L=y$ modulo $m$, with $|L(e)|\le m-1$, and with $L(e)=0$ exactly where $y(e)=0$. Put $F=W+qL$. This is an integer flow. The residue of $qL(e)$ modulo $k$ depends only on the residue of $L(e)$ modulo $m$; so $qL=h-W$ modulo $k$, and $F=h$ modulo $k$. Let $e\notin E_0$. Then $F(e)=W(e)$ modulo $q$, and this is not $0$; so $F(e)\ne 0$. And $1-q(m-1)\le F(e)\le q-1+q(m-1)$, so $|F(e)|\le k-1$. Let $e\in E_0$. Then $W(e)=0$ and $h(e)\ne 0$, so $y(e)\ne 0$ and $L(e)\ne 0$. So $F(e)=qL(e)$ is not $0$, and $|F(e)|\le q(m-1)