Monochromatic loose path partitions in k-uniform hypergraphs

A conjecture of Gy'{a}rf'{a}s and S'{a}rk"{o}zy says that in every $2$-coloring of the edges of the complete $k$-uniform hypergraph $K_n^k$, there are two disjoint monochromatic loose paths of distinct colors such that they cover all but at most $k-2$ vertices. A weaker form of this conjecture with $2k-5$ uncovered vertices instead of $k-2$ is proved, thus the conjecture holds for $k=3$. The main result of this paper states that the conjecture is true for all $k\ge 3$.