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

Graph theory isn’t enough. The mathematical language for talking about connections, which usually depends on networks — vertices (dots) and edges (lines connecting them) — has been an invaluable way ...

Now that pandemic restrictions are easing up, people are getting together again. But it’s been a while, so if you and your friends need some help breaking the ice, here’s a mathematical party game you ...