Erdős Problem #550

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$ then prove that\[R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1.\]

#550: [EFRS85]

graph theory | ramsey theory

Disclaimer: The open status of this problem reflects the current belief of the owner of this website. There may be literature on this problem that I am unaware of, which may partially or completely solve the stated problem. Please do your own literature search before expending significant effort on solving this problem. If you find any relevant literature not mentioned here, please add this in a comment.

Chvátal [Ch77] proved that $R(T,K_m)=(m-1)(n-1)+1$.

This problem is #16 in Ramsey Theory in the graphs problem collection.

View the LaTeX source

External data from the database - you can help update this
Formalised statement? No (Create a formalisation here)

0 comments on this problem

Likes this problem	None
Interested in collaborating	None
Currently working on this problem	None
This problem looks difficult	None
This problem looks tractable	None

When referring to this problem, please use the original sources of Erdős. If you wish to acknowledge this website, the recommended citation format is:

T. F. Bloom, Erdős Problem #550, https://www.erdosproblems.com/550, accessed 2026-01-16