Erdős problem 835
Does there exist a such that the -sized subsets of {1,...,2k} can be coloured with colours such that for every with all colours appear among the -sized subsets of ?
Erdős Problems records this as verifiable.
No Repository has ruled on it here.
How far the record reaches4 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal13 retained
- Resolutionverifiable
- WorkNone recorded
- DecisionNone here
- 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.