On Ramsey numbers for paths versus wheels


Salman, A.N.M. and Broersma, H.J. (2004) On Ramsey numbers for paths versus wheels. [Report]

open access
For two given graphs $F$ and $H$, the Ramsey number $R(F,H)$ is the smallest positive integer $p$ such that for every graph $G$ on $p$ vertices the following holds: either $G$ contains $F$ as a subgraph or the complement of $G$ contains $H$ as a subgraph. In this paper, we study the Ramsey numbers $R(P_{n},W_{m})$, where $P_{n}$ is a path on $n$ vertices and $W_{m}$ is the graph obtained from a cycle on $m$ vertices by adding a new vertex and edges joining it to all the vertices of the cycle. We present the exact values of $R(P_{n},W_{m})$ for the following values of $n$ and $m$: $n=1,2,3$ or $5$ and $m\geq 3$; $n=4$ and $m=3,4,5$ or $7$; $n\geq 6$ and ($m$ is odd, $3\leq m\leq 2n-1$) or ($m$ is even, $4\leq m\leq n+1$); odd $n\ge7$ and $m=2n-2$ or $m=2n$ or $m\geq (n-3)^2$; odd $n\geq 9$ and $q\cdot n-2q+1\leq m\leq q\cdot n-q+2$ with $3\leq q\leq n-5$. Moreover, we give nontrivial lower bounds and upper bounds for $R(P_{n},W_{m})$ for the other values of $m$ and $n$.
Item Type:Report
Additional information:Imported from MEMORANDA
Electrical Engineering, Mathematics and Computer Science (EEMCS)
Research Group:
Link to this item:http://purl.utwente.nl/publications/65926
Export this item as:BibTeX
HTML Citation
Reference Manager


Repository Staff Only: item control page