Every graph has 2 n − 1 − 1 {\displaystyle 2^{n-1}-1} cuts, among which at most ( n 2 ) {\displaystyle {\tbinom {n}{2}}} can be minimum cuts.
Svaki graf ima 2 n − 1 − 1 {\displaystyle 2^{n-1}-1} rezova, među kojima najviše može biti ( n 2 ) {\displaystyle {\tbinom {n}{2}}} minimalnih rezova.