\section{The coarse classification and the orders from \texorpdfstring{$3999$}{3999} on}\label{b8:sec} In this section and in the next ones, $n$ is the order of a group $\Gam$. Theorem~\ref{b0:G10} leaves only cyclic groups of three kinds, as soon as the order is at least $100$. \begin{lemma}\label{b8:factor} Let $n\ge 28$ be an integer. Then $n$ is a prime, or $n=2p$ or $n=3p$ with a prime $p$, or $n=d\,d'$ with integers $4\le d\le d'$. \end{lemma} \begin{proof} Let $n$ be not a prime. Let $q$ be the least prime factor of $n$, and $n'=n/q$. Every prime factor of $n'$ is at least $q$, so $n'\ge q$. If $q\ge 5$, take $d=q$ and $d'=n'$. So let $q$ be $2$ or $3$. If $n'$ is a prime, then $n=2p$ or $n=3p$. Otherwise $n'=n_1n_2$ with integers $2\le n_1\le n_2$. If $qn_1\le n_2$, take $d=qn_1\ge 4$ and $d'=n_2$. If $qn_1>n_2$ and $n_2\ge 4$, take $d=n_2$ and $d'=qn_1$. If $n_2\le 3$, then $n=qn_1n_2\le 27$, which is excluded. \end{proof} \begin{corollary}[The coarse classification]\label{b8:coarse} Let $\Gam$ be a finite abelian group of order $n\ge 100$. Then $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$, except possibly if $\Gam$ is cyclic and $n$ is a prime power, or $n=2p$, or $n=3p$ with a prime $p$. \end{corollary} \begin{proof} Let $n$ be not a prime, not $2p$ and not $3p$. By Lemma~\ref{b8:factor}, $n=d\,d'$ with $4\le d\le d'$. Then $d'^{\,2}\ge d\,d'=n\ge 100$, so $d'\ge 10$ and $d=n/d'\le n/10$. If $\Gam$ is not cyclic of prime-power order, Theorem~\ref{b0:G10} says that $\Fl(G,\Gam)$ is connected. So an exception is a cyclic group of prime-power order, or a group of order $p$, $2p$ or $3p$. A group of prime order is cyclic. Let $n=2p$ or $n=3p$. Since $n\ge 100$, the prime $p$ is greater than $3$. So $\Gam$ is the product of its subgroups of order $2$ or $3$ and of order $p$, and it is cyclic. \end{proof} \begin{lemma}[Prime powers near $4000$]\label{b8:powers} The only prime powers $n$ with $3024\le n\le 4090$ that are not primes are $3125=5^{5}$, $3481=59^{2}$ and $3721=61^{2}$. So every prime power from $3999$ to $4090$ is a prime. \end{lemma} \begin{proof} Let $n=p^{j}$ with $j\ge 2$ and $3024\le n\le 4090$. \emph{Let $j$ be even.} Then $n$ is the square of $x=p^{j/2}$. Since $54^{2}=2916<3024$ and $64^{2}=4096>4090$, we have $55\le x\le 63$. Of these nine numbers, only $59$ and $61$ are prime powers: $55=5\cdot 11$, $56=2^{3}\cdot 7$, $57=3\cdot 19$, $58=2\cdot 29$, $60=2^{2}\cdot 3\cdot 5$, $62=2\cdot 31$, $63=3^{2}\cdot 7$. So $n=59^{2}$ or $n=61^{2}$. \emph{Let $j$ be odd.} Then $j\ge 3$ and $p^{3}\le 4090<16^{3}=4096$, so $p\le 13$. The powers of these primes around the interval are \begin{gather*} 2^{11}=2048,\ 2^{12}=4096;\qquad 3^{7}=2187,\ 3^{8}=6561;\qquad 5^{4}=625,\ 5^{5}=3125,\ 5^{6}=15625;\\ 7^{4}=2401,\ 7^{5}=16807;\qquad 11^{3}=1331,\ 11^{4}=14641;\qquad 13^{3}=2197,\ 13^{4}=28561 . \end{gather*} Only $5^{5}=3125$ is in the interval. \end{proof} \begin{proposition}[Orders from $3999$ on]\label{b8:3999} Let $\Gam$ be a finite abelian group of order $n\ge 3999$. Then $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$. \end{proposition} \begin{proof} By Corollary~\ref{b8:coarse} we may assume that $\Gam=\Z_n$ and that $n$ is a prime power, or $n=2p$, or $n=3p$. We use the lemmas of Section~\ref{b7:sec} with the trivial group $A'$. \begin{condlist}{(c)} \item[\textup{(a)}] $n=2p$. Then $p\ge 3999/2$, so $p\ge 2000$. Lemma~\ref{b7:D}. \item[\textup{(b)}] $n=3p$. Then $p\ge 1333$. Lemma~\ref{b7:T}. \item[\textup{(c)}] $n$ is a prime. Lemma~\ref{b7:P}. \item[\textup{(d)}] $n$ is a prime power and not a prime. By Lemma~\ref{b8:powers}, $n\ge 4091$. Lemma~\ref{b7:G7}.\qedhere \end{condlist} \end{proof}