Erdős Problem #780 — The chromatic number of Kneser hypergraphs
Statement
Let be positive integers with . If the -element subsets of an -element set are coloured with colours, must some colour contain pairwise disjoint sets?
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.