Flows and Connectivity · Connectivity
Lesson 5
Problem. Let \(s\) and \(t\) be two different nodes of the complete graph \(K_{n}\). What is the maximum number of edge-disjoint paths between \(s\) and \(t\)?
Hint:
Work out the case of \(K_{3}\) and \(K_{4}\) to develop your intuition.
5 points