On the set-coloring Ramsey numbers of graphs

Mengya He, Yaping Mao

The \textit{set-coloring Ramsey number} ${\mathrm{R}}_{r,s}(G_1,G_2,...,G_r)$ is the least $n\in \mathbb{N}$ such that every coloring $χ: E\left(K_n\right) \rightarrow\binom{[r]}{s…