A graph G is said to be Ramsey for a tuple of graphs (H1,...,Hr)
if every r-coloring of the edges of G contains a monochromatic copy
of Hi in color i, for some i. A fundamental question at the
intersection of Ramsey theory and the theory of random...