\section{Small groups}\label{b10:sec} Theorem~\ref{b0:G10} is a statement on small groups, too. An integer $n$ has a divisor $d$ with $4\le d\le n/10$ if and only if $n=d\,d''$ with integers $d\ge 4$ and $d''\ge 10$. So the least such $n$ is $40$. \begin{corollary}[The orders below $100$]\label{b10:small} Exactly $29$ integers $n<100$ have a divisor $d$ with $4\le d\le n/10$: \begin{equation}\label{b10:eq:list} \begin{gathered} 40,\ 44,\ 48,\ 50,\ 52,\ 55,\ 56,\ 60,\ 64,\ 65,\ 66,\ 68,\ 70,\ 72,\ 75,\\ 76,\ 77,\ 78,\ 80,\ 84,\ 85,\ 88,\ 90,\ 91,\ 92,\ 95,\ 96,\ 98,\ 99 . \end{gathered} \end{equation} Let $\Gam$ be an abelian group whose order is one of these numbers, and let $\Gam$ be not the cyclic group $\Z_{64}$. Then $\Fl(G,\Gam)$ is connected for every finite bridgeless multigraph $G$ \textup{(}loops allowed\textup{)}. \end{corollary} \begin{proof} The products $d\,d''<100$ with $d\ge 4$ and $d''\ge 10$ have $d\le 9$. They are: \begin{center} \small \begin{tabular}{@{}ll@{}} \hline $d$ & the products $d\,d''<100$ with $d''\ge 10$\\ \hline $4$ & $40$, $44$, $48$, $52$, $56$, $60$, $64$, $68$, $72$, $76$, $80$, $84$, $88$, $92$, $96$\\ $5$ & $50$, $55$, $60$, $65$, $70$, $75$, $80$, $85$, $90$, $95$\\ $6$ & $60$, $66$, $72$, $78$, $84$, $90$, $96$\\ $7$ & $70$, $77$, $84$, $91$, $98$\\ $8$ & $80$, $88$, $96$\\ $9$ & $90$, $99$\\ \hline \end{tabular} \end{center} The union of the six lines is the list~\eqref{b10:eq:list}; it has $29$ numbers. The only prime power in the list is $64$. So a group $\Gam$ as in the statement is not cyclic of prime-power order, and Theorem~\ref{b0:G10} applies. \end{proof} \begin{remark}[Examples]\label{b10:examples} Order $40$, with $d=4$ and the quotient of order $10$: the three abelian groups $\Z_{40}$, $\Z_2\times\Z_{20}$ and $\Z_2\times\Z_2\times\Z_{10}$. Order $44$: $\Z_{44}$ and $\Z_2\times\Z_{22}$. Order $48$: all five abelian groups. Order $50$, with $d=5$: $\Z_{50}$ and $\Z_5\times\Z_{10}$. Order $64$, with $d=4$: all abelian groups of order $64$ except $\Z_{64}$; one of them is $(\Z_2)^{6}$. The subgroup of order $d$ need not be a direct factor: the group $\Z_2\times\Z_{32}$ has no direct factor of order $4$. \end{remark} \begin{remark}[The cyclic group of order $64$]\label{b10:rem64} The group $\Z_{64}$ is cyclic of prime-power order, so Theorem~\ref{b0:G10} says nothing about it. The paper~\cite{A} has $\Fl(G,\Z_{64})$ connected for every finite bridgeless multigraph $G$: this is the case $k=64$ of \Aref{thm:bases}, by \Aref{thm:Z}, part~(a). \end{remark} \begin{remark}[The group $(\Z_2)^{8}$]\label{b10:Z28} Esperet, Hendrey, Lagoutte, Marseloo, Norin and Steiner proved that $\Fl(G,(\Z_2)^{8})$ is connected for every $2$-edge-connected graph $G$ \cite[Theorem~6.15]{EHLMNS}, and they asked whether the cardinality $256$ of this group can be improved. The group $(\Z_2)^{j}$ has order $2^{j}$, and its order has a divisor $d$ with $4\le d\le 2^{j}/10$ if and only if $j\ge 6$. So Theorem~\ref{b0:G10} gives $(\Z_2)^{6}$, of order $64$, and also $(\Z_2)^{7}$ and $(\Z_2)^{8}$. The least order of a group in Theorem~\ref{b0:G10} is $40$. For the orders below $40$, and for the groups $(\Z_2)^{j}$ with $j\le 5$, this paper has no statement. \end{remark} \begin{remark}[From $100$ to $3023$]\label{b10:middle} For an order $n$ with $100\le n\le 3023$, Corollary~\ref{b8:coarse} says which groups are left: the cyclic groups $\Z_n$ with $n$ a prime power, $n=2p$ or $n=3p$. Section~\ref{b11:sec} comes back to them. \end{remark}