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)\le kn+O(1)$$for any tree $T$ on $n$ vertices?

gpt-erdos · GPT-5.2 Pro + Deep Research · unverified

Not known in general — it is a classical **open problem of Erdős and Graham**.

llm-hunter · gpt pro 5.2 · unverified

1 LLM attack(s) recorded (gpt pro 5.2); unverified.