New lower bound for multicolor Ramsey numbers for even cycles (Q2571306): Difference between revisions

For given graphs \(G_1,G_2,\dots,G_k\), \(k\geq 2\), the multicolour Ramsey number \(R(G_1,G_2,\dots,G_k)\) is the smallest integer \(n\) such that if we arbitrarily colour the edges of the complete graph of order \(n\) with \(k\) colours then it always contains a monochromatic copy of \(G_i\) coloured with \(i\), for some \(1\leq i\leq k\). We denote such a number by \(R_k(G)\), if \(G=G_1= G_2=\cdots= G_k\). For all integers \(m\geq 2\), it is proved that \(R_m (C_{2m})\geq (k+1)m\), if \(k\) is an odd integer \(\geq 1\), and that \(R_m(C_{2m})\geq (k+1)m-1\), if \(k\) is an even integer \(\geq 2\). From it the authors get the following new bound: \(16\leq R_3(C_8) \leq 648\).