Let be a 2-edge-connected simple graph on vertices and an (additive) abelian group with . In this paper, we prove that if for every , , then either is -connected or can be reduced to one of and by repeatedly contracting proper -connected subgraphs, where is a cycle of length . We also show that the bound is the best possible.