# On Ramsey numbers for paths versus wheels

Salman, A.N.M.
and
Broersma, H.J.
(2007)
*On Ramsey numbers for paths versus wheels.*
Discrete Mathematics, 307
(7-8).
pp. 975-982.
ISSN 0012-365X

PDF
Restricted to UT campus only : Request a copy 410kB |

Abstract: | For two given graphs and , the Ramsey number is the smallest positive integer such that for every graph on vertices the following holds: either contains as a subgraph or the complement of contains as a subgraph. In this paper, we study the Ramsey numbers , where is a path on vertices and is the graph obtained from a cycle on vertices by adding a new vertex and edges joining it to all the vertices of the cycle. We present the exact values of for the following values of and or 5 and ; and or 7; and ( is odd, ) or ( is even, ); odd and or or ; odd and with . Moreover, we give nontrivial lower bounds and upper bounds for for the other values of and . |

Item Type: | Article |

Faculty: | Electrical Engineering, Mathematics and Computer Science (EEMCS) |

Research Group: | |

Link to this item: | http://purl.utwente.nl/publications/61767 |

Official URL: | http://dx.doi.org/10.1016/j.disc.2005.11.049 |

Export this item as: | BibTeX EndNote HTML Citation Reference Manager |

Repository Staff Only: item control page

Metis ID: 241727