Let G = (V(G), E(G)) be a graph. A set S ⊆ E(G) is an edge k-cut in G if the graph G − S = (V(G), E(G) \ S) has at least k connected components. The generalized k-edge connectivity of a graph G, ...

A uniformly random graph on n vertices with a fixed degree sequence, obeying a γ subpower law, is studied. It is shown that, for γ > 3, in a subcritical phase with ...