The Graph Ramsey Number $R(F_{\ell },K_6)$

Shin-ya Kadota, Tomokazu Onozuka, Yuta Suzuki

For a given pair of two graphs $(F,H)$, let $R(F,H)$ be the smallest positive integer $r$ such that for any graph $G$ of order $r$, either $G$ contains $F$ as a subgraph or the com…