On a conjecture of Conlon, Fox and Wigderson

Chunchao Fan, Qizhong Lin, Yuanhui Yan

For graphs $G$ and $H$, the Ramsey number $r(G,H)$ is the smallest positive integer $N$ such that any red/blue edge coloring of the complete graph $K_N$ contains either a red $G$ o…