On multicolor Ramsey numbers for loose $k$-paths of length three

Abstract

We show that there exists an absolute constant $A$ such that for each $k\ge 2$ and every coloring of the edges of the complete $k$-uniform hypergraph on $Ar$ vertices with $r$ colors, one of the color classes contains a loose path of length three.