Skip to content

Erdős problem 183

Start work

Let R(3;k)R(3;k) be the least nn such that every kk-colouring of the edges of KnK_n contains a monochromatic triangle. Determine lim⁡k→∞R(3;k)1/k\lim_{k\to\infty} R(3;k)^{1/k} (a $250 Erdős prize problem). A superexponential lower bound resolves the problem: the limit is infinite.

Nothing has been recorded here yet.

How far the record reaches3 of 6 stages
  1. Sourceerdos-problems
  2. StatementRetained
  3. Formal2 retained
  4. ResolutionNone filed
  5. WorkNone recorded
  6. DecisionNone here
  7. The questionNot reached
What this record is missingResolution

No source retained here records an outcome for this question.

Its collection still marks it open.

Open the source record
Where the source files it318 share a topic
Graph Theory275Ramsey Theory114
None carries a Standing. Browse the topic.
Start workOpen sources