Skip to content

Erdős problem 835

Does there exist a k>2k>2 such that the kk-sized subsets of {1,...,2k} can be coloured with k+1k+1 colours such that for every A⊂{1,…,2k}A\subset \{1,\ldots,2k\} with ∣A∣=k+1\lvert A\rvert=k+1 all k+1k+1 colours appear among the kk-sized subsets of AA?

Sources

The source's own material, retained exactly.

13 retained statements36c6d0fef71a

Open selected source

FormalConjectures/ErdosProblems/

835.lean

Retained formal statement1 of 13

It is known that for 3≤k≤83 \leq k \leq 8, the chromatic number of J(2k,k)J(2k, k) is greater than k+1k+1, see Johnson graphs.

FormalConjectures/ErdosProblems/835.leanErdos835.chromaticNumber_johnson_2k_k_lower_bound1 lineExact file
∀ {k : ℕ}, 3 ≤ k → k ≤ 8 → ↑k + 1 < (SimpleGraph.johnson (2 * k) k).chromaticNumber
SolvedStatement only, no proof