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 note some interesting properties of the class of point processes which are Markov with respect to the 'connected component' relation. Results in the literature imply that this class is closed under ...