arXiv Analytics

Sign in

arXiv:1510.08488 [math.CO]AbstractReferencesReviewsResources

A note on the Ramsey number of even wheels versus stars

Sh. Haghi, H. R. Maimani

Published 2015-10-28Version 1

For two graphs $G_1$ and $G_2$ the Ramsey number $R(G_1,G_2)$ is the smallest integer $N$, such that for any graph on $N$ vertices either $G$ contains $G_1$ or $\overline{G}$ contains $G_2$. Let $S_n$ be a star of order $n$ and $W_m$ be a wheel of order $m+1$. In this paper, it is shown that $R(W_n,S_n)\leq{5n/2-1}$, where $n\geq{6}$ is even. It was proven a theorem which implies that $R(W_n,S_n)\geq{5n/2-2}$, where $n\geq{6}$ is even. Therefore we conclude that $R(W_n,S_n)=5n/2-2$ or $5n/2-1$, for $n\geq{6}$ and even.

Categories: math.CO
Subjects: 05C55, 05D10
Related articles: Most relevant | Search more
arXiv:1902.00259 [math.CO] (Published 2019-02-01)
Ramsey numbers of ordered graphs under graph operations
arXiv:1312.2081 [math.CO] (Published 2013-12-07)
The Ramsey numbers of paths versus wheels: a complete solution
arXiv:1208.1732 [math.CO] (Published 2012-08-08, updated 2013-12-13)
Ramsey numbers of cubes versus cliques