Number of mincuts of a graph without using Karger's algorithm
The $\binom{n}{2}$ bound I think was originally proven by Dinitz, Karzanov and Lomonosov in 1976, in "A structure for the system of all minimum cuts of a graph".  Perhaps you can find what you're looking for in this paper, but I'm not sure if it's online.