Ramsey and Gallai-Ramsey number for wheels (Q2115156): Difference between revisions

Given two graphs \(G\) and \(H\), the general \(k\)-colored Gallai-Ramsey number gr\(_{k}(G:H)\) is defined to be the minimum integer \(m\) such that every \(k\)-coloring of the complete graph on \(m\) vertices contains either a rainbow copy of \(G\) or a monochromatic copy of \(H\). In this paper, the authors give upper and lower bounds for classical Ramsey number of the wheel \(W_n\) as follows: For \(k \geq 1\) and \(n \geq 7\), \(3n-3 \leq R(W_n,W_n) \leq 8n - 10\), if \(n\) is even and \(2n - 2 \leq R(W_n,W_n)\leq 6n - 8\), if \(n\) is odd. They also obtain the exact value of gr\(_{k}(K_3:W_5)\) for every \(k\geq 1\). Finally, general upper and lower bounds on the Gallai-Ramsey numbers for all wheels are provided.