Three results on cycle-wheel Ramsey numbers

Yanbo Zhang; Haitze J. Broersma; Yaojun Chen

doi:10.1007/s00373-014-1523-0

Three results on cycle-wheel Ramsey numbers

Yanbo Zhang, Haitze J. Broersma, Yaojun Chen

Research output: Contribution to journal › Article › Academic › peer-review

2 Citations (Scopus)

112 Downloads (Pure)

Abstract

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.

Original language	Undefined
Pages (from-to)	2467-2479
Number of pages	13
Journal	Graphs and combinatorics
Volume	31
Issue number	6
DOIs	https://doi.org/10.1007/s00373-014-1523-0
Publication status	Published - Nov 2015

Keywords

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

Access to Document

10.1007/s00373-014-1523-0

GCpaper

http://eprints.eemcs.utwente.nl/secure2/26624/01/GCpaper.pdf

Cite this

@article{52b88974ad5b4ed3b02ba546923d852b,

title = "Three results on cycle-wheel Ramsey numbers",

abstract = "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.",

keywords = "MSC-05C, EWI-26624, Cycle, IR-98922, Ramsey number, METIS-315119, Wheel",

author = "Yanbo Zhang and Broersma, {Haitze J.} and Yaojun Chen",

note = "Open access ",

year = "2015",

month = nov,

doi = "10.1007/s00373-014-1523-0",

language = "Undefined",

volume = "31",

pages = "2467--2479",

journal = "Graphs and combinatorics",

issn = "0911-0119",

publisher = "Springer",

number = "6",

}

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

SN - 0911-0119

VL - 31

SP - 2467

EP - 2479

JO - Graphs and combinatorics

JF - Graphs and combinatorics

IS - 6

ER -