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?

Erdős Problems records this as verifiable.

No Repository has ruled on it here.

How far the record reaches4 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal13 retained
  4. Resolutionverifiable
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingWork

Nothing here has checked that finding.

Reproducing it here turns a report into evidence.

Where the source files it285 share a topic
None carries a Standing. Browse the topic.