论文信息 - R(C6, K5) = 21andR(C7, K5) = 25

R(C6, K5) = 21andR(C7, K5) = 25

The Ramsey number R(Cn, Km) is the smallest integer p such that any graph G on p vertices either contains a cycleCn with length n or contains an independent set with order m. In this paper we prove that R(Cn, K5) = 4(n? 1) + 1 (n= 6, 7).

Yi Ru Huang | Jian Sheng Yang | Zhang Ke Min

[1] Frank Harary,et al. Generalized Ramsey theory for graphs. III. Small off-diagonal numbers. , 1972 .

[2] Béla Bollobás,et al. On a conjecture involving cycle-complete graph Ramsey numbers , 2000, Australas. J Comb..

[3] Richard H. Schelp,et al. All Ramsey numbers for cycles in graphs , 1974, Discret. Math..

[4] V. Rosta. On a ramsey-type problem of J. A. Bondy and P. Erdös. I , 1973 .

[5] Noga Alon,et al. On a Ramsey-type problem , 2000 .

[6] Neil J. A. Sloane,et al. An On-Line Version of the Encyclopedia of Integer Sequences , 1994 .

[7] M. Clancy,et al. Some small ramsey numbers , 1977, J. Graph Theory.

[8] George R. T. Hendry,et al. Ramsey numbers for graphs with five vertices , 1989, J. Graph Theory.