Chromatic Ramsey number of acyclic hypergraphs

András Gyárfás, Alexander W. N. Riasanovsky, Melissa U. Sherman-Bennett

Suppose that $T$ is an acyclic $r$-uniform hypergraph, with $r\ge 2$. We define the ($t$-color) chromatic Ramsey number $\chi (T,t)$ as the smallest $m$ with the following property: if…