New upper bound for multicolor Ramsey number of odd cycles - Details

author：

Lin, Q. (Lin, Q..) ^[1] | Chen, W. (Chen, W..) ^[2]

Indexed by：

Scopus

Abstract：

Let　[Formula　presented]　be　the　[Formula　presented]-color　Ramsey　number　of　an　odd　cycle　[Formula　presented]　of　length　[Formula　presented].　It　is　shown　that　for　each　fixed　[Formula　presented],　[Formula　presented]for　all　sufficiently　large　[Formula　presented],　where　[Formula　presented]　is　a　constant.　This　improves　an　old　result　by　Bondy　and　Erdős　(1973).　©　2018　Elsevier　B.V.

Keyword：

Odd cycle; Ramsey number; Upper bound

Community：

[ 1 ] [Lin, Q.]Center for Discrete Mathematics, Fuzhou University, Fuzhou, 350108, China
[ 2 ] [Chen, W.]College of Mathematics and Computer Science, Fuzhou University, Fuzhou, 350108, China

Reprint 's Address：

[Lin, Q.]Center for Discrete Mathematics, Fuzhou UniversityChina

Email：

linqizhong@fzu.edu.cn

Show more details

Related Keywords：

Source ：

Discrete Mathematics

ISSN： 0012-365X

Year： 2019

Issue： 1

Volume： 342

Page： 217-220

0 . 7 7

JCR@2019

0 . 7 0 0

JCR@2023

ESI HC Threshold：59

JCR Journal Grade：3

CAS Journal Grade：3

Cited Count：

WoS CC Cited Count：

SCOPUS Cited Count： 2

ESI Highly Cited Papers on the List： 0 Unfold All

WanFang Cited Count：

Chinese Cited Count：

30 Days PV： 0

Affiliated Colleges：

Get Fulltext

DOI Library Discovery Baidu Scholar Search SCOPUS

Type
Departments

All Years Choose Year From to