{"schema":"vela.problem-packet.v0.1","problem":183,"statement":"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}.\\]","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[{"id":"A003323","name":"Multicolor Ramsey numbers R(3,3,...,3), where there are n 3's.","terms":"2,3,6,17","url":"https://oeis.org/A003323"}],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}