Flows and Connectivity · Menger’s Theorem
Lesson 1
Problem. What is the maximum number of edge-disjoint paths from vertex 1 to vertex 0 in the graph below? What is the minimum number of edges you need to remove from this graph so that there is no path left from 1 to 0? Enter two numbers separated by a space (the maximum first, then the minimum).
