Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
11024743 | Finite Fields and Their Applications | 2019 | 12 Pages |
Abstract
For given graphs H1,...,Hk, kâ¥2, the k-color Ramsey number R(H1,...,Hk) is the smallest integer N such that every k-coloring of the edges of a complete graph KN contains a monochromatic copy of Hi colored in i, for some i with 1â¤iâ¤k. Let Câ,K1,m and Pn denote a cycle of length â, a star of order m+1 and a path of order n, respectively. In this paper, it is shown that R(C4,K1,m,Pn)â¤m+nâ1+âm+nâ2â for all m,nâ¥2 and R(C4,K1,m,Pn)â¤m+nâ2+âm+nâ2â if m+n=â2+3 and ââ¥1. Moreover, by discussing the local structure of the polarity graph whose vertices are points in the projective plane over Galois fields, we show that the two upper bounds can be attained for some special m and n. These results also extend some known results on R(C4,K1,m) obtained by Parsons in 1975 and by Zhang et al. recently.
Related Topics
Physical Sciences and Engineering
Mathematics
Algebra and Number Theory
Authors
Fangfang Zhang, Yunqing Zhang, Yaojun Chen,