2015/11/02 by Conlon, David, Fox, Jacob, Rödl, Vojtěch · 1 citation
#Combinatorics (math.CO) #FOS: Mathematics
paper · doi:10.48550/arxiv.1511.00563
We exhibit a family of 3-uniform hypergraphs with the property that their 2-colour Ramsey numbers grow polynomially in the number of vertices, while their 4-colour Ramsey numbers grow exponentially. This is the first example of a class of hypergraphs whose Ramsey numbers show a strong dependence on the number of colours.