New lower bounds for some multicolored Ramsey numbers (Q1277139): Difference between revisions

Two distinct methods are used to derive new lower bounds for multicolored Ramsey numbers of complete graphs. In the first part of the paper, finite fields are used to show that \(R(5,5,5) \geq 242\) and \(R(6,6,6) \geq 693\). In the second part constructive arguments based on an earlier work by Chung are used to show that \(R(3,3,3,k_1,\ldots,k_r) \geq 3 R(3,3,k_1,\ldots,k_r) + R(k_1,\ldots,k_r) - 3\). This inequality yields several improved lower bounds for Ramsey numbers \(R(3,3,3,k_1)\).