Erdős Problem #562
Statement
Let denote the -uniform hypergraph Ramsey number: the minimal such that if we -colour all edges of the complete -uniform hypergraph on vertices then there must be some monochromatic copy of the complete -uniform hypergraph on vertices. Prove that, for , where denotes the -fold iterated logarithm. That is, does grow like where the tower of exponentials has height ?
Record
- Source
- Added
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.