Directed Graphs and Network Flows · Challenge problem

A network of cables (each usable in either direction, but only once) joins $s,a,b,c,t$ with cables $sa$, $sb$, $sc$, $ab$, $at$, $bt$, $ct$, $bc$. What is the maximum number of pairwise edge-disjoint paths from $s$ to $t$?