On the use of senders for asymmetric tuples of cliques in Ramsey theory

Simona Boyadzhiyska, Thomas Lesgourgues

A graph $G$ is $q$-Ramsey for a $q$-tuple of graphs $(H_1,\dots ,H_q)$ if for every $q$-coloring of the edges of $G$ there exists a monochromatic copy of $H_i$ in color $i$ for som…