%0 Journal Article
%T On the k-pairs problem
%A Ali Al-Bashabsheh
%A Abbas Yongacoglu
%J Mathematics
%D 2008
%I arXiv
%X We consider network coding rates for directed and undirected $k$-pairs networks. For directed networks, meagerness is known to be an upper bound on network coding rates. We show that network coding rate can be $\Theta(|V|)$ multiplicative factor smaller than meagerness. For the undirected case, we show some progress in the direction of the $k$-pairs conjecture.
%U http://arxiv.org/abs/0805.0050v1