We prove that in an undirected graph there are at most $O(n^2)$ cuts of size strictly less than $\frac{3}{2}$ the size of the minimum cut.