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?
Retained from Formal Conjectures · not edited here
Formal statements
3 open · 8 solved · 2 test
Erdős Problems says
verifiable
Decision here
No current contribution
Checks
0 checks · 13 formal

Current Result

Accepted in Vela Mathematics Program

Current Result

No result has been accepted here yet.

Type
Evidence
0 artifacts
Decision
None
Reviewed
No date retained

Search problems.science

Find a Problem, Result, source, or page