Erdős problem 835
Does there exist a such that the -sized subsets of {1,...,2k} can be coloured with colours such that for every with all colours appear among the -sized subsets of ?
Sources
FormalConjectures/ErdosProblems/
835.lean
Retained formal statement
It can be seen that the chromatic number of is for all odd .
∀ (k : ℕ), 2 < k → Odd k → ↑k + 1 < (SimpleGraph.johnson (2 * k) k).chromaticNumberSolvedStatement only, no proof