### Abstract

Original language | Undefined |
---|---|

Pages (from-to) | 2467-2479 |

Number of pages | 13 |

Journal | Graphs and combinatorics |

Volume | 31 |

Issue number | 6 |

DOIs | |

State | Published - Nov 2015 |

### Fingerprint

### Keywords

- MSC-05C
- EWI-26624
- Cycle
- IR-98922
- Ramsey number
- METIS-315119
- Wheel

### Cite this

*Graphs and combinatorics*,

*31*(6), 2467-2479. DOI: 10.1007/s00373-014-1523-0

}

*Graphs and combinatorics*, vol 31, no. 6, pp. 2467-2479. DOI: 10.1007/s00373-014-1523-0

**Three results on cycle-wheel Ramsey numbers.** / Zhang, Yanbo; Broersma, Haitze J.; Chen, Yaojun.

Research output: Scientific - peer-review › Article

TY - JOUR

T1 - Three results on cycle-wheel Ramsey numbers

AU - Zhang,Yanbo

AU - Broersma,Haitze J.

AU - Chen,Yaojun

N1 - Open access

PY - 2015/11

Y1 - 2015/11

N2 - Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels versus cycles of even order; and large cycles versus generalized odd wheels.

AB - Given two graphs G1 and G2, the Ramsey number R(G1,G2) is the smallest integer N such that, for any graph G of order N, either G1 is a subgraph of G, or G2 is a subgraph of the complement of G. We consider the case that G1 is a cycle and G2 is a (generalized) wheel. We expand the knowledge on exact values of Ramsey numbers in three directions: large cycles versus wheels of odd order; large wheels versus cycles of even order; and large cycles versus generalized odd wheels.

KW - MSC-05C

KW - EWI-26624

KW - Cycle

KW - IR-98922

KW - Ramsey number

KW - METIS-315119

KW - Wheel

U2 - 10.1007/s00373-014-1523-0

DO - 10.1007/s00373-014-1523-0

M3 - Article

VL - 31

SP - 2467

EP - 2479

JO - Graphs and combinatorics

T2 - Graphs and combinatorics

JF - Graphs and combinatorics

SN - 0911-0119

IS - 6

ER -