In this paper, we study a multicolor variant of Erdős--Rogers functions. Let f⏐䂺; ₊_₈䃑, , K₈䂻 (n) be the largest integer m such that there is always an induced Kₛ-free subgraph of size m in every n-vertex graph with a t-edge-coloring in which the edges with the j-th color induce no copy of K₈䲛. We establish both upper and lower bounds for this multicolor version. Specifically, we show that f⏐䃕; ₊䃓, ₊䃓 (n) = n^1/2+o (1), Ω (n^5/11) f⏐䃕; ₊䃓, ₊䃓, ₊䃓 (n) n^1/2+o (1), and Ω (n^20/61) f⏐䃕; ₊䃓, ₊䃓, ₊䃓, ₊䃓 (n) n^1/3+o (1).
Liu et al. (Mon,) studied this question.