The Ramsey Numbers of Large cycles Versus Odd Wheels期刊界 All Journals 搜尽天下杂志传播学术成果专业期刊搜索期刊信息化学术搜索

The Ramsey Numbers of Large cycles Versus Odd Wheels

Authors:	Surahmat E. T. Baskoro Ioan Tomescu

Affiliation:	(1) Department of Mathematics Education, Universitas Islam Malang, Jalan MT Haryono 193, Malang, 65144, Indonesia;(2) Department of Mathematics, Institut Teknologi Bandung, Jalan Ganesa 10, Bandung, Indonesia;(3) Faculty of Mathematics and Computer Science, University of Bucharest, Str. Academiei, 14, 010014 Bucharest, Romania

Abstract:	For given graphs G and H, the Ramsey number R(G, H) is the smallest positive integer N such that for every graph F of order N the following holds: either F contains G as a subgraph or the complement of F contains H as a subgraph. In this paper, we determine the Ramsey number R(C_n, W_m) = 3n − 2 for odd m ≥ 5 and $n > frac{5m-9}{2}$ . Surahmat, Ioan Tomescu: Part of the work was done while the first and the last authors were visiting the School of Mathematical Sciences, Government College University, Lahore, Pakistan. Surahmat: Research partially support under TWAS, Trieste, Italy, RGA No: 06-018 RG/MATHS/AS–UNESCO FR: 3240144875.

Keywords:	Ramsey number cycle wheel
本文献已被 SpringerLink 等数据库收录！