Tomasz Łuczak, Joanna Polcyn, Andrzej Ruciński
Published 2017-03-28Version 1
We show that there exists an absolute constant $A$ such that for each $k\ge2$ 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.
Multicolor Ramsey numbers of cycles in Gallai colorings
On size Ramsey numbers for a pair of cycles
On Lagrangians of $3$-uniform hypergraphs
![QR code for arXiv:1703.09687 [math.CO]](http://oss.arxitics.com/images/favicon.svg)