Let $m_1\leq\cdots\leq m_k$ and $n$ be sufficiently large. If $T$ is a tree on $n$ vertices and $G$ is the complete multipartite graph with vertex class sizes $m_1,\ldots,m_k$, prove that $R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1$.

No current result

No reviewed Result is current in Vela Mathematics Program. Retained source material is shown below.

No source in this release retained material for this Problem beyond its catalogue entry.

Reported activity

Reported by these sources. Not reviewed here.

• AI standalone

  Erdős AI contributions wiki · 22 Jun, 2026

  Machine

  GPT

  Open the source record

• Subtle errors

  GPT-Erdős

  Open the source record

• argument

  VibeMathed

  Machine

  ChatGPT

  People

  Eric Li

  Reported outcome

  candidate

  Open the source record