R(5,5) > 42

The two coloring of the edges of K42 which established the lower bound is available as a 0-1 adjacency matrix .

This construction was originally found in 1987 with a fairly complex genetic algorithm. Since then I've found very simple methods that can produce the same construction (with the aid of much faster computers).

Geoff Exoo