Hedgehogs are not colour blind
classification
🧮 math.CO
keywords
colournumbersramseygrowhypergraphsnumberblindclass
read the original abstract
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.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.