Diagonal Ramsey numbers for wheels

Maoxuan Li, Masaki Kashima, Yaping Mao

The Ramsey number $\mathrm{R}(G_1,G_2)$ is the smallest integer $N$ such that any red-blue coloring of the edges of the complete graph $K_N$ contains either a red copy of $G_1$ or…