Erdős problem 564
Let be the minimal such that if the edges of the -uniform hypergraph on vertices are -coloured then there is a monochromatic copy of the complete -uniform hypergraph on vertices.
Nothing has been recorded here yet.
How far the record reaches3 of 6 stages
- Sourceerdos-problems
- StatementRetained
- Formal1 retained
- ResolutionNone filed
- WorkNone recorded
- DecisionNone here
- The questionNot reached
What this record is missingResolution
No source retained here records an outcome for this question.
Its collection still marks it open.
Where the source files it328 share a topic
None carries a Standing. Browse the topic.