Erdős Problem #161
Statement
Let and . Let be the smallest such that we can -colour the edges of the complete -uniform hypergraph on vertices such that if with then there are at least many -subsets of of each colour. For fixed as we change from to does increase continuously or are there jumps? Only one jump?
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.