Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2023/ii/paper-4/17h/a/solution

The vertex form of Menger theorem states that if and are distinct nonadjacent vertices of a finite graph, then the maximum number of pairwise internally vertex-disjoint paths from to equals the minimum cardinality of an - vertex separator.

New to topics? Read the docs here!