Proves R(T, K_{m1,...,mk}) ≤ (k-1)(R(T, K_{m1,m2})-1) + m1 for large n-vertex trees T and fixed k, m_i.
Chvátal, Tree-complete graph Ramsey numbers,J
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.CO 1years
2026 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
A Resolution of Erd\H{o}s Problem 550 on Tree versus Complete Multipartite Ramsey Numbers
Proves R(T, K_{m1,...,mk}) ≤ (k-1)(R(T, K_{m1,m2})-1) + m1 for large n-vertex trees T and fixed k, m_i.