A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2022; you can also visit the original URL.
The file type is
A graph F is Ramsey for a pair of graphs (G,H) if any red/blue-coloring of the edges of F yields a copy of G with all edges colored red or a copy of H with all edges colored blue. Two pairs of graphs are called Ramsey equivalent if they have the same collection of Ramsey graphs. The symmetric setting, that is, the case G=H, received considerable attention. This led to the open question whether there are connected graphs G and G' such that (G,G) and (G',G') are Ramsey equivalent. We makearXiv:2206.03898v1 fatcat:j4cgsutipnctfe4f6l53nlny7u