Number of min-cuts of a graph

It can be shown that every graph G has at most $$\binom{n}{2}$$ min-cuts. It follows from Karger’s algorithm Analysis.

Is there a different combinatorial proof of this fact? Was this known before Karger’s paper?