Erdős Problem #564 — Let R_3(n) be the minimal m such that if the edges of the 3-uniform hypergraph on m vertices are 2-coloured then there is a monochromatic copy of the complete 3-uniform hypergraph on n v…
Statement
Let be the minimal such that if the edges of the -uniform hypergraph on vertices are -coloured then there is a monochromatic copy of the complete -uniform hypergraph on vertices. Is there some constant such that
Record
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.