New lower bound formulas for multicolored Ramsey numbers (Q5960793)

Two recursive lower bound formulas for multicolored Ramsey numbers \(R=R(k_1,k_2,\ldots,k_r)\), \(r \geq 3\), are given, where \(R\) is the smallest integer such that any \(r\)-coloring of the edges of the complete graph \(K_R\) contains a monochromatic \(K_{k_j}\) of color \(j\). The formulas are derived by construction and imply, for example, the improved bounds \(R(4,4,4,4,4) \geq 1372\), \(R(5,5,5,5,5) \geq 7329\), \(R(6,6,6,6) \geq 5346\), \(R(7,7,7,7) \geq 19261\) and \(R(3,3,3,11) \geq 437\).