### Jaehoon Kim (김재훈), Ramsey numbers of cycles versus general graphs

Room B232 IBS (기초과학연구원)The Ramsey number $R(F,H)$ is the minimum number $N$ such that any $N$-vertex graph either contains a copy of $F$ or its complement contains $H$. Burr in 1981 proved a …