Ramsey equivalence for asymmetric pairs of graphs

Simona Boyadzhiyska, Dennis Clemens, Pranshu Gupta +1

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 colo…