Monochromatic Hamiltonian Berge-cycles in colored complete uniform hypergraphs (Q2477627)

In an \(r\)-uniform hypergraph an \textit{\(r\)-uniform \(\ell\)-cycle} or \textit{Berge-cycle of length \(\ell\)} is a sequence of distinct vertices \(v_1,v_2,\dots,v_\ell\), together with distinct edges \(e_1,e_2,\dots,e_\ell\), such that \(e_i\) contains \(v_i,v_{i+1}\) \((v_{\ell+1}=v_1)\). A Berge-cycle of length \(n\) in a hypergraph on \(n\) vertices is said to be \textit{Hamiltonian}. After formulating a conjecture, the authors prove four theorems. Conjecture 1.1. Assume that \(r\geq2\) is fixed, and \(n\) is sufficiently large; then every \((r-1)\)-colouring of the edges of the complete \(r\)-uniform hypergraph on \(n\) vertices, \(K_n^{(r)}\), contains a monochromatic Hamiltonian Berge-cycle. Theorem 1.2. If the edges of \(K_n^{(3)}\) (\(n\geq5\)) are coloured with two colours, then there exists a monochromatic Hamiltonian Berge-cycle. Theorem 1.3. If the edges of \(K_n^{(r)}\) (\(n\geq4\)) are coloured with \(\lfloor\frac{r-1}2\rfloor\) colours and \(n\) is sufficiently large, then there exists a monochromatic Hamiltonian Berge-cycle. Theorem 1.4. For all \(\eta>0\) there exists \(n_0=n_0(\eta)\) such that every colouring of the edges of \(K_n^{(4)}\), \(n\geq n_0\) with 3 colours contains a monochromatic Berge-cycle of length at least \((1-\eta)n\). Theorem 1.5. For all \(\eta>0\) and all integers \(r,k\geq2\) with \(r\geq k+\left\lfloor\log_2(k+1)\right\rfloor\) there exists \(n_0=n_0(\eta,r,k)\) such that, for every \(n>n_0\), every colouring of the edges of \(K_n^{(r)}\) with \(k\) colours contains a monochromatic Berge-cycle of length at least \((1-\eta)n\). The proofs of the last two theorems are described as using the approach of authors Gyárfás and Sárközy in their paper ``The three-colour Ramsey number of a 3-uniform Berge cycle'' (submitted for publication).