1 paper
Ron Aharoni, Eli Berger, Agelos Georgakopoulos +2
We prove a strong version of the Max-Flow Min-Cut theorem for countable networks, namely that in every such network there exist a flow and a cut that are "orthogonal" to each other…