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, ...

We consider first-passage percolation on the class of “high-dimensional” graphs that can be written as an iterated Cartesian product G G . . . G of some base graph G as the number of factors tends to ...