An upper bound on the Ramsey number of trees

DOI10.1016/0012-365X(87)90107-5zbMath0617.05048MaRDI QIDQ1821795

Zsolt Tuza, András Gyárfás

Publication date: 1987

Published in: Discrete Mathematics (Search for Journal in Brave)

zbMATH Keywords

Ramsey numbermonochromatic copy

Mathematics Subject Classification ID

Trees (05C05) Generalized Ramsey theory (05C55)

Related Items

Constructing trees in bipartite graphs, Splits with forbidden subgraphs, Highly connected monochromatic subgraphs, Monochromatic coverings and tree Ramsey numbers

Cites Work

• Unnamed Item
• Unnamed Item