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?
That would depend on what you know about graphs. Do you know the Max-Flow-Min-Cut theorem?
Sign up using Google
Sign up using Facebook
Sign up using Stack Exchange
3 years ago