A proof of a conjecture of Gyárfás, Lehel, Sárközy and Schelp on Berge-cycles

It has been conjectured that, for any fixed \[{\text{r}} \geqslant 2\] and sufficiently large n, there is a monochromatic Hamiltonian Berge-cycle in every \[({\text{r}} - 1)\]-colouring of the edges of \[{\text{K}}_{\text{n}}^{\text{r}}\], the complete r-uniform hypergraph on n vertices. In this paper we prove this conjecture.