Erdős Problem #550
Prior state unknown→proved
Claimed proved in a preprint of E. Li; erdosproblems.com still lists the problem open pending human review
SourceReplayReproducedFormal proofStatement auditExternal checkExpert reviewPeer review
combinatorics / Graph Theory, Ramsey Theory
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$, prove that $R(T,G)\leq (\chi(G)-1)(R(T,K_{m_1,m_2})-1)+m_1$.
10Significance / 100
1Frontier events
0Verification tasks
0Recorded attempts
Temporal state
Current frontier
No reconciled state yet.
Append-only history
Frontier timeline
Research memory
Claims and attempts
Scoped claims
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$.
Claimed proved in a preprint of E. Li; erdosproblems.com still lists the problem open pending human review
Recorded attempts
Evidence graph
Connected research record
No public relationships recorded yet.