On the Ramsey numbers for stars versus complete graphs (Q709240)

For graphs \(G_1,G_2,\dots,G_s\), a \((G_1,G_2,\dots,G_s;r)\)-coloring is a coloring of the edges of the complete graph \(K_r\) with \(s\) colors such that it does not contain a subgraph isomorphic to \(G_i\) all edges of which are colored with color \(i\), for each \(1 \leq i \leq s\). The multicolor Ramsey number \(R(G_1,G_2,\dots,G_s)\) is defined to be the least positive integer \(r\) such that there exist no \((G_1,G_2,\dots,G_s;r)\)-colorings. The following main theorem is proved in this paper. Let \(p_1,\dots,p_m\), \(q_1, \dots , q_n\) be positive integers, with \(p_i, q_j \geq 2\) for \(i =1, \dots , m\) and \(j = 1, \dots , n\). Then \[ R(K_{p_1},\dots,K_{p_m},K_{1,q_1}, \dots,K_{1,q_n}) - 1 = \left ( \sum^n\limits_{j=1} q_j - n + \epsilon_Q - 1 \right )(R(K_{p_1}, \dots , K_{p_m}) - 1), \] where \(\epsilon_Q =1 \) if the number of even integers in the set \(\{q_1, \dots , q_n\}\) is even and positive, and \(\epsilon_Q = 2\) otherwise.