Ramsey numbers of color critical graphs versus large generalized fans

Taiping Jiang, Xinmin Hou

Given two graphs $G$ and $H$, the {Ramsey number} $R(G,H)$ is the smallest positive integer $N$ such that every 2-coloring of the edges of $K_N$ contains either a red $G$ or a bl…