Sharp bounds for off-diagonal and tripartite canonical Ramsey numbers

Source abstract

The canonical Ramsey theorem establishes that for every positive integer $t$, there is a sufficiently large $n$ such that every edge-colouring of a complete graph $K_n$ contains a copy of $K_t$ that is canonically coloured, i.e. monochromatic, rainbow, or lexicographic. In this paper we investigate two variations of this theorem. First, we study canonical Ramsey numbers in the multipartite hypergraph setting. We prove that in every edge-colouring of the 3-uniform complete hypergraph on at least $t^{151t^2}$ vertices, there always exists a canonically coloured copy of $K_{t, t, t}^{(3)}$. This estimate is sharp up to the constant in the exponent. Second, we explore off-diagonal canonical Ramsey numbers. Let $ER(a, b, c)$ denote the minimum number of vertices $n$ required to guarantee a monochromatic $K_a$, a lexicographic $K_b$, or a rainbow $K_c$ in every edge-colouring of the complete graph $K_n$. We establish sharp bounds for these numbers across different parameter regimes. Specifically, we prove that $ER(a, b, c)\geq c^{Ω(ab)}$ when $c$ is sufficiently large relative to $a$, and that $ER(a, b, c)\leq 2^{O_b(a)}$ when $b\ge 4$ is a fixed constant and $c\le a$. Finally, we analyse the behaviour of the function when avoiding lexicographic triangles (i.e. $b=3$), showing that $ER(a, 3, c)\le (a-1)(c-2)+O(c^6)$.