For two given graphs $$G_1$$G1 and $$G_2$$G2, the Ramsey number $$R(G_1,G_2)$$R(G1,G2) is the least integer r such that for every graph G on r vertices, either G contains a $$G_1$$G1 or $$\overline{G}$$G¯ contains a $$G_2$$G2. In this note, we determined the Ramsey number $$R(K_{1,n},W_m)$$R(K1,n,Wm) for even m with $$n+2\le m\le 2n-2$$n+2≤m≤2n-2, where $$W_m$$Wm is the wheel on $$m+1$$m+1 vertices, i.e., the graph obtained from a cycle $$C_m$$Cm by adding a vertex v adjacent to all vertices of the $$C_m$$Cm.
['Binlong Li', 'Ingo Schiermeyer']
On Star---Wheel Ramsey Numbers