Graph limit theory provides a rigorous framework for analysing sequences of large graphs by representing them as continuous objects known as graphons – symmetric measurable functions on the unit ...

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

Discrete structures are omnipresent in mathematics, computer science, statistical physics, optimisation and models of natural phenomena. For instance, complex random graphs serve as a model for social ...