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?

Workspace

Open this exact Problem, source revision, and authority Repository in Workbench. This handoff does not clone, switch, upload, or execute anything.

Canvas

public preview
  1. Source#835
  2. ResultNone
  3. Checks0

Reported activity

Work these sources record against this Problem. Source-reported attribution, not reviewed here.

Search problems.science

Find a Problem, Result, source, or page