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
∀ (k : ℕ), 0 < k → ((SimpleGraph.johnson (2 * k) k).chromaticNumber = ↑k + 1 ↔ Erdos835.Property k)TestStatement only, no proof