Author:
Dubroff Quentin,Girão António,Hurley Eoin,Yap Corrine
Abstract
Resolving a problem of Conlon, Fox, and R\"{o}dl, we construct a family of hypergraphs with arbitrarily large tower height separation between their $2$-colour and $q$-colour Ramsey numbers. The main lemma underlying this construction is a new variant of the Erd\H{o}s--Hajnal stepping-up lemma for a generalized Ramsey number $r_k(t;q,p)$, which we define as the smallest integer $n$ such that every $q$-colouring of the $k$-sets on $n$ vertices contains a set of $t$ vertices spanning fewer than $p$ colours. Our results provide the first tower-type lower bounds on these numbers.
Reference21 articles.
1. Stanley, R. P. (2011). Enumerative Combinatorics, vol. 1. Cambridge Studies in Advanced Mathematics.
2. Set-coloring of edges and multigraph Ramsey numbers;Xu;Graphs and Combinatorics,2009
3. Aragão, L., Collares, M., Marciano, J. P., Martins, T., Morris, R. (2022). A lower bound for set-coloring Ramsey numbers. arXiv preprint arXiv:2212.06802.
4. Conlon, D., Fox, J., He, X., Mubayi, D., Suk, A., Verstraëte, J. (2022). Set-coloring Ramsey numbers via codes. arXiv preprint arXiv:2206.11371.
5. On a Ramsey type theorem;Erdős;Periodica Mathematica Hungarica 2(1-4),1972