Fig. 7
From: A continuous-time MaxSAT solver with high analog performance
Colorings for the R(5, 5) Ramsey number problem. a A coloring of the complete graph on N = 42 nodes that avoids monochromatic 5-cliques. b The adjacency matrix corresponding to the coloring in (a), using the same colors. c The best coloring of the complete graph on N = 43 nodes containing only 2 monochromatic (red) 5-cliques, sitting on 6 nodes (highlighted with thicker edges). d The adjacency matrix corresponding to the coloring in (c), using the same colors. The thicker red (blue) edges from (c) are represented with darker red (blue) cells. Supplementary Fig. 9 shows a reordered version of this matrix such that the 5-cliques can be seen in the upper left corner of the matrix
