The Ramsey numbers of large cycles versus odd wheels (Q2482346): Difference between revisions

It is shown that the Ramsey number \(R(C_n, W_m) = 3n - 2\) for odd \(m \geq 5\) and \(n > (5m - 9)/2\), where \(W_m\) is the the wheel on \(m + 1\) vertices. This gives another class of pairs of graphs \((G, H)\) that satisfy the condition that \(R(G, H) = (\chi(H) - 1)(| G| - 1) + 1\) that comes from the canonical edge coloring. The paper ends with a reasonable conjecture consistent with the canonical coloring that \(R(C_n, W_m) = 3n - 2\) when \(m\) is odd and \(n \geq m \geq 3\) with \((n, m) \neq (3,3)\) and \(R(C_n, W_m) = 2n - 1\) when \(m\) is even and \(n \geq m \geq 4\) with \((n, m) \neq (4,4)\).