Abstract
AbstractThe q-color Ramsey number of a k-uniform hypergraph G, denoted r(G; q), is the minimum integer N such that any coloring of the edges of the complete k-uniform hypergraph on N vertices contains a monochromatic copy of G. The study of these numbers is one of the most central topics in combinatorics. One natural question, which for triangles goes back to the work of Schur in 1916, is to determine the behavior of r(G; q) for fixed G and q tending to infinity. In this paper, we study this problem for 3-uniform hypergraphs and determine the tower height of r(G; q) as a function of q. More precisely, given a hypergraph G, we determine when r(G; q) behaves polynomially, exponentially or double exponentially in q. This answers a question of Axenovich, Gyárfás, Liu and Mubayi.
Funder
Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung
Publisher
Springer Science and Business Media LLC
Reference19 articles.
1. Abbott, H.L., Williams, E.R.: Lower bounds for some Ramsey numbers. J. Comb. Theory Ser. A 16(1), 12–17 (1974)
2. Alon, N., Lovász: vectors, graphs and codes. In Building Bridges II: Mathematics of László Lovász, pp. 1–16. Springer (2020)
3. Alon, N., Spencer, J.H.: The Probabilistic Method. John Wiley & Sons (2016)
4. Axenovich, M., Gyárfás, A., Hong, L., Mubayi, D.: Multicolor Ramsey numbers for triple systems. Discrete Math. 322, 69–77 (2014)
5. Campos, M., Griffiths, S., Morris, R., Sahasrabudhe, J.: An exponential improvement for diagonal Ramsey. arXiv preprint arXiv:2303.09521, (2023)