Graphs with largest number of minimum cuts Original Research Article

Let σ(n, k) be the largest number of k-cuts in a k-edge-connected multigraph with n vertices. We determine σ(n, k) and characterize extremal multigraphs for every n and k. The same problem is also investigated for graphs with no multiple edges.