On a generalized anti-Ramsey problem (Q5955206): Difference between revisions

For integers \(p,q_1,q_2 > 0\), a coloring of \(E(K_n)\) is called \((p,q_1,q_2)\)-coloring if at least \(q_1\) and at most \(q_2\) different colors appear at the edges of every \(K_p \subseteq K_n\). \(R(n,p,q_1,q_2)\) denotes the maximum number of colors in a \((p,q_1,q_2)\)-coloring of \(E(K_n)\). The authors prove several bounds, especially for \(R(n,p,q_1,q_2) = O(n)\) and \(R(n,p,q_1,q_2) = O(n^2)\).