How would you prove that the number of cuts in a graph (where cut is a set of edges which split two vertices) cannot be smaller than the number of directed paths from one vertex to the other?
Comparing the number of cuts and paths in graph
1
$\begingroup$
graph-theory
discrete-mathematics