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 statement6 of 13

Johnson's bound for the independence number of the Johnson graph.

FormalConjectures/ErdosProblems/835.leanErdos835.indepNum_johnson_le_johnsonBound1 lineExact file
∀ {n k : ℕ}, (SimpleGraph.johnson n k).indepNum ≤ Erdos835.johnsonBound n 4 k
SolvedStatement only, no proof