Monochromatic loose path partitions in k-uniform hypergraphs

Changhong Lu, Bing Wang, Ping Zhang

A conjecture of Gyárfás and Sárkö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…