The Ramsey numbers for stars of even order versus a wheel of order nine

Authors:
Yunqing Zhang;Yaojun Chen;Kemin Zhang
Affiliations:
Department of Mathematics, Nanjing University, Nanjing 210093, PR China;Department of Mathematics, Nanjing University, Nanjing 210093, PR China;Department of Mathematics, Nanjing University, Nanjing 210093, PR China
Venue:
European Journal of Combinatorics
Year:
2008

Citing 4
Cited 1

Pancyclism and bipancyclism of Hamiltonian graphs

Journal of Combinatorial Theory Series B
The Ramsey numbers of stars versus wheels

European Journal of Combinatorics
Graph Theory With Applications

Graph Theory With Applications
Weakly pancyclic graphs

Journal of Graph Theory

On the Ramsey numbers for stars versus complete graphs

European Journal of Combinatorics

Quantified Score

Hi-index	0.00

Visualization

Abstract

For two given graphs G"1 and G"2, the Ramsey number R(G"1,G"2) is the smallest positive integer n such that for any graph G of order n, either G contains G"1 or the complement of G contains G"2. Let S"n denote a star of order n and W"m a wheel of order m+1. In this paper, we show that R(S"n,W"8)=2n+2 for n=6 and n=0(mod2).