Erdős problem 183 · problems.science

Let $R(3;k)$ be the least $n$ such that every $k$ -colouring of the edges of $K_n$ contains a monochromatic triangle. Determine $\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.

Sources

Browse retained paths and inspect the exact material available for this Problem.

3 retained statements2415f78e850a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

Let $R(3;k)$ be the least $n$ such that every $k$-colouring of the edges of $K_n$ contains a monochromatic triangle. Determine $\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.

Open exact source location

Sources

Search problems.science