Erdős problem 550 · problems.science

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$ .

Sources

Browse retained paths and inspect the exact material available for this Problem.

1 retained statement2415f78e850a

Open selected source

Retained excerpts/

VibeMathed

Retained source excerpt1 of 1

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$.

Open exact source location

Sources

Search problems.science