{"schema":"vela.problem-packet.v0.1","problem":557,"statement":"Let $R_k(G)$ denote the minimal $m$ such that if the edges of $K_m$ are $k$-coloured then there is a monochromatic copy of $G$. Is it true that\\[R_k(T)\\leq kn+O(1)\\]for any tree $T$ on $n$ vertices?","status":"open","seam":"raw","closureRoutes":[],"obligations":[],"attestations":[],"attempts":[],"velaLean":[],"oeis":[],"generated_note":"derived view; the signed event log is the source of truth (vela check / vela reproduce)"}