\section{Introduction}\label{b0:sec} Let $G$ be a finite multigraph and $\Gam$ a finite abelian group. A $\Gam$-flow of $G$ is nowhere zero if no edge has the value $0$. The graph $\Fl(G,\Gam)$ has the nowhere-zero $\Gam$-flows of $G$ as its vertices; two flows are adjacent if the support of their difference is a cycle of $G$. This graph is studied by Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner in~\cite{EHLMNS}. A multigraph with a bridge has no nowhere-zero flow. The question is: for which groups $\Gam$ is $\Fl(G,\Gam)$ connected for every bridgeless $G$? The exact definitions are in Section~\ref{b1:sec}. \subsection*{New results} \begin{itemize} \item \emph{Every finite abelian group of order at least $3024$} \textup{(}Theorem~\ref{b0:main}\textup{)}: $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$. This improves the bound of \cite[Theorem~6.23]{EHLMNS}, a number with $694$ digits, to $3024$. For $4$-edge-connected graphs, Cranston, Li, Su, Wang and Xu~\cite[Theorem~6.1]{CLSWX} have every abelian group of order at least $5{,}251{,}339$. \item \emph{Cyclic groups of prime order} \textup{(}a case of Theorem~\ref{b0:main}\textup{)}: $\Fl(G,\Z_p)$ is connected for every finite bridgeless multigraph $G$ and every prime $p\ge 3024$. The bound of~\cite[Corollary~6.19]{EHLMNS} for these groups is $p>2.26\cdot 10^{15}$. \end{itemize} Theorem~\ref{b0:G10} below is not new: it is \Aref{thm:G10}, and it is stated here because the proofs use it. \begin{theorem}[Every group of order at least $3024$]\label{b0:main} Let $\Gam$ be a finite abelian group of order at least $3024$. Then $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$. Loops are allowed, and $G$ need not be connected. \end{theorem} \begin{theorem}[A subgroup of index at least $10$]\label{b0:G10} Let $\Gam$ be a finite abelian group that is not cyclic of prime-power order, and let $|\Gam|$ have a divisor $d$ with $4\le d\le|\Gam|/10$. Then $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$ \textup{(}loops allowed\textup{)}. \end{theorem} Theorem~\ref{b0:G10} is \Aref{thm:G10}; Part~I of~\cite{A} is mainly about integer flows. It is stated here because the present paper rests on it. It follows from the master theorem of~\cite{A} and from an averaging lemma of~\cite{A}; Section~\ref{b1:proofG10} gives these few lines. All statements of~\cite{A} that this paper uses are listed in Section~\ref{b1:quoted}. \subsection*{Small groups} The least orders of groups in Theorem~\ref{b0:G10} are $40$, $44$, $48$ and $50$. Corollary~\ref{b10:small} lists the $29$ orders below $100$: for each of them every abelian group of this order is reached, except the cyclic group $\Z_{64}$. One of the groups is $(\Z_2)^{6}$. From the order $100$ on, Theorem~\ref{b0:G10} reaches every abelian group, except the cyclic groups whose order is a prime power, twice a prime or three times a prime \textup{(}Corollary~\ref{b8:coarse}\textup{)}. \subsection*{A cyclic factor} The cyclic groups $\Z_n$ that are left need another method. It works for a group $\Z_n\times A'$ with any finite abelian group $A'$. Let $S_0$ be the set of the classes of $-27,\dots,27$ in $\Z_n$. A unit $c$ of $\Z_n$ is used as a \emph{scale}: a flow $f$ is replaced by $cf$. A unit is \emph{bad} if $cu=w$ in $\Z_n$ for some integers $u$, $w$ with $1\le|u|,|w|\le 54$, and \emph{good} otherwise; $M$ is the group that the good units generate. A \emph{scale set} is a non-empty set $M_0$ of elements of $M$ such that, for every $z\ne 0$, at most one ninth of the elements $c$ of $M_0$ have $cz$ in $S_0$ \textup{(}Definitions~\ref{b3:def} and~\ref{b4:scaleset}\textup{)}. The central statement is Theorem~\ref{b5:product}: if $n\ge 109$ and a scale set exists, then $\Fl(G,\Z_n\times A')$ is connected for every $A'$ and every bridgeless $G$. Its proof is in Sections~\ref{b2:sec}--\ref{b5:sec}. The scale set gives a scale under which a flow avoids $S_0$ on eight ninths of the edges \textup{(}Lemma~\ref{b4:scale}\textup{)}. An induction on the graph then leads to a flow that avoids $S_0$ on all edges \textup{(}Lemma~\ref{b4:G4}\textup{)}; on the way the scale changes by good units only. Such flows are joined through integer flows \textup{(}Lemma~\ref{b2:middle}\textup{)}. Corollary~\ref{b6:criteria} turns this into criteria. $M$ itself is a scale set if $|M|\ge 486$; if $n=2p$ and $|M|\ge 252$; or if $n=3p$ and $|M|\ge 324$. Counts of the bad units \textup{(}Lemma~\ref{b3:bad}\textup{)} and the fact that the index of $M$ is an integer give these criteria for every prime $n\ge 3999$, for $n=2p$ with $p\ge 2000$, for $n=3p$ with $p\ge 1333$, and for every prime power $n\ge 4091$ \textup{(}Section~\ref{b7:sec}\textup{)}. With Corollary~\ref{b8:coarse} this proves Theorem~\ref{b0:main} for the orders from $3999$ on \textup{(}Proposition~\ref{b8:3999}\textup{)}. \subsection*{The orders from 3024 to 3998} In this interval $231$ orders are a prime power, twice a prime or three times a prime. For $230$ of them a table gives a good unit and its exact order in $\units{n}$; the order is at least $486$, $252$ or $324$ \textup{(}Table~\ref{bapp:table} in the appendix\textup{)}. The table is a part of the proof. It is a list of equations of integers, and Section~\ref{bapp:procedure} gives a procedure that checks it. For the order $3062$ the proof uses a scale set with $90$ elements \textup{(}Proposition~\ref{b9:3062}\textup{)}. \subsection*{The boundary} For $55\le n\le 3024$ no unit of $\Z_n$ is good \textup{(}Proposition~\ref{b11:nogood}\textup{)}. So $3024$ is the end of this method. It is not a counterexample: Remark~\ref{b11:residual} lists the groups of smaller order that the theorems of this paper do not reach. \subsection*{Comparison} The numbers in this paragraph are those that the two cited papers state; no claim is made on other literature. In~\cite{EHLMNS}, $\Fl(G,\Z_p\times A')$ is connected if $p>27q^{8}+28$ for some $q\ge 55$ that is coprime to $p$ \cite[Corollary~6.19]{EHLMNS}; so $p>27\cdot 55^{8}+28\approx 2.26\cdot 10^{15}$. For all abelian groups the bound of \cite[Theorem~6.23]{EHLMNS} is $|\Gam|\ge(56^{8}\cdot 27+28)^{45}+1$, a number with $694$ digits. For a small group, \cite[Theorem~6.15]{EHLMNS} has $(\Z_2)^{8}$, of order $256$, and the paper asks whether this cardinality can be improved; see Remark~\ref{b10:Z28}. Cranston, Li, Su, Wang and Xu~\cite{CLSWX} have all abelian groups of order at least $5{,}251{,}339$ for $4$-edge-connected graphs. Here the bound is $3024$ for all bridgeless multigraphs, and the least order of a group is $40$. The proof for a cyclic factor follows the plan of \cite[Section~6]{EHLMNS}. The extraction of a good subgraph, the bounded avoidance, the signed cycle decomposition and the middle band \textup{(}Lemmas~\ref{b1:extraction}, \ref{b1:bounded}, \ref{b1:cycledec} and~\ref{b2:middle}\textup{)} are \cite[Lemma~6.1, Corollary~6.10, Lemma~2.2, Lemma~6.18]{EHLMNS}. The difference is in the scales. In~\cite{EHLMNS} the scales are the nine powers $q^{0},\dots,q^{8}$ of one number $q$. Here every unit of $\Z_n$ is a scale, two scales can follow each other if their ratio is good \textup{(}Lemma~\ref{b3:G1}\textup{)}, and the average is taken over a scale set. \subsection*{What is not claimed} All statements of this paper are about group flows. Integer flows are the subject of~\cite{A}. There the graph on the integer flows $F$ of $G$ with $1\le|F(e)|\le k-1$ for every edge $e$ is shown to be connected for every finite bridgeless loopless multigraph $G$, for $k=40$, $k=48$ and every multiple $k$ of $4$ with $k\ge 52$ \Aref{thm:bases}. The present paper adds nothing on integer flows. It gives no graph $G$ with a disconnected $\Fl(G,\Gam)$, and it does not claim that the numbers $3024$ and $40$ are best possible. \subsection*{The sections} Section~\ref{b1:sec}: conventions, the statements that are quoted, the proof of Theorem~\ref{b0:G10}, and three tools. Sections~\ref{b2:sec}--\ref{b6:sec}: the cyclic factor. Section~\ref{b7:sec}: primes, twice primes, three times primes and prime powers. Section~\ref{b8:sec}: the coarse classification and the orders from $3999$ on. Section~\ref{b9:sec}: the orders from $3024$ to $3998$ and the proof of Theorem~\ref{b0:main}. Section~\ref{b10:sec}: small groups. Section~\ref{b11:sec}: the boundary of the method. The appendix has the table and the procedure that checks it.