A variation of Menger's theorem for long paths

In this paper we prove a Mengerian theorem for long paths, namely, that if in order to cut every uv-path of length at least n (n ≥ 2), in a diagraph D, we need to remove at least h points, then there exist {$\text{h}\text{(3n ? 5)}$} interior disjoint uv-paths in D of length at least n. Some variations and applications of this theorem are given as well.