Flows and Connectivity · Menger’s Theorem
Lesson 3
To destroy all paths from 1 to 0, it’s enough to remove the edges \((1,2)\), \((7,0)\), and \((8,0)\). The graph without these edges is shown below.

Is it possible to achieve the same result by removing only two edges? If not, why?