Combinatorics (10) 11. Find the maximal flow and the minimal cut in this network. Solution for maximal flow draw imaginary loop from t to s now write the equation incoming traffic in t = outgoing traffic from t so, x(b,t)+x(f,t)+x(e,t)= x(t,s) so now just replace values and find x(t,s) which will be the maximal flow leaving out..