New lower bound for multicolor Ramsey numbers for even cycles
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\).
- New upper bound for multicolor Ramsey number of odd cycles
- New lower bounds on the multicolor Ramsey numbers \(r_k(C_4)\)
- Multicolour Ramsey numbers of odd cycles
- Gallai-Ramsey number of even cycles with chords
- An improved lower bound for multicolor Ramsey numbers and a problem of Erdős
- A note on multicolor Ramsey number of small odd cycles versus a large clique
- Exact values of multicolor Ramsey numbers \(R_l(C_{\le l+1})\)
- Multicolour Ramsey numbers of paths and even cycles
- New lower bounds on the multicolor Ramsey numbers \(R_{r}(C_{2m})\)
- scientific article; zbMATH DE number 4148133 (Why is no real title available?)
- On multicolor Ramsey numbers for even cycles in graphs.
- Gallai-Ramsey numbers of \(C_{10}\) and \(C_{12}\)
- Multicolor Ramsey Numbers for Paths and Cycles
- Random bipartite Ramsey numbers of long cycles
- Improved bounds on the multicolor Ramsey numbers of paths and even cycles
- Ramsey and Gallai-Ramsey numbers of cycles and books
This page was built for publication: New lower bound for multicolor Ramsey numbers for even cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2571306)
