3 problems

Let a $k$-pair network be a directed acyclic network with sources $S=\{s_1,\dots,s_k\}$ and sinks $T=\{t_1,\dots,t_k\}$. It is strongly reachable if, for every $j$, there are edge-…

Let a $k$-pair network have sources $s_1,\dots,s_k$ and sinks $t_1,\dots,t_k$, and suppose it is strongly reachable, meaning that for every sink $t_j$ there are edge-disjoint direc…

In an undirected communication network, consider transmitting multiple independent messages between specified source–sink pairs. Li and Li's conjecture. Network coding cannot achie…