The tripartite Ramsey number for trees

DOI10.1016/j.endm.2009.07.101zbMath1273.05139arXiv0904.3433OpenAlexW4236700734MaRDI QIDQ5891229

Julia Böttcher, Jan Hladký, Diana Piguet

Publication date: 10 October 2013

Published in: Electronic Notes in Discrete Mathematics, Journal of Graph Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/0904.3433

zbMATH Keywords

treesmaximum degreetripartite graphstwo coloringSchelp's conjecture

Mathematics Subject Classification ID

Trees (05C05) Coloring of graphs and hypergraphs (05C15) Generalized Ramsey theory (05C55)

Related Items (2)

Stability for vertex cycle covers ⋮ Some Ramsey-Turán type problems and related questions

Cites Work

• Unnamed Item
• Unnamed Item
• Sparse partition universal graphs for graphs of bounded degree
• All Ramsey numbers for cycles in graphs
• \(R(C_n,C_n,C_n)\leqq (4+o(1))n\)
• Ramsey numbers for trees of small maximum degree
• On a Ramsey-type problem of J. A. Bondy and P. Erdős. II
• Tripartite Ramsey numbers for paths
• Multipartite Ramsey numbers for odd cycles
• Regular pairs in sparse random graphs I
• The size-Ramsey number of trees

This page was built for publication: The tripartite Ramsey number for trees