On Ramsey numbers of complete graphs with dropped stars

Jonathan Chappelon, Luis Pedro Montejano, Jorge Ramírez Alfonsín

Let $r(G,H)$ be the smallest integer $N$ such that for any $2$-coloring (say, red and blue) of the edges of $K\_n$, $n⩾N$, there is either a red copy of $G$ or a blue copy…