@book{fedffee1f5bd44b7bbd944621a1d305d,

title = "The Ramsey numbers of large cycles versus small wheels",

abstract = "For two given graphs $G$ and $H$, the \textit{Ramsey number} $R(G,H)$ is the smallest positive integer $N$ such that for every graph $F$ of order $N$ the following holds: either $F$ contains $G$ as a subgraph or the complement of $F$ contains $H$ as a subgraph. In this paper, we determine the Ramsey number $R(C_n,W_{m})$ for $m=4$ and $m=5$. We show that $R(C_{n},W_{4})=2n-1$ and $R(C_n,W_5)=3n-2$ for $n\geq 5$. For larger wheels it remains an open problem to determine $R(C_n,W_{m})$.",

keywords = "MSC-05C55, IR-65821, EWI-3454, MSC-05D10, METIS-208268",

author = "Surahmat and E.T. Baskoro and H.J. Broersma",

note = "Imported from MEMORANDA",

year = "2002",

language = "English",

series = "Memorandum",

publisher = "University of Twente, Department of Applied Mathematics",

number = "1634",

}