The value of the Ramsey number R(Cn, K4) is 3(n - 1) + 1 (n≥ 4)

Australasian Journal of Combinatorics

Volumn 20, Issue , 1999, Pages 205-206

  Sheng, Yang Jian ^a   Ru, Huang Yi ^a   Min, Zhang Ke ^b  

^a SHANGHAI UNIVERSITY   (China)

^b NANJING UNIVERSITY   (China)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84885941402     PISSN: 10344942     EISSN: 22023518     Source Type: Journal    
DOI: None     Document Type: Article

References (8)

1. J.A. Bondy and P. Erdos, Ramsey numbers for cycles in graphs, Journal of Combinatorial Theory, Series B (1973), 14 46-54.
2. V. Chvatal and F. Harary, Generalized Ramsey theory fOT graphs, III. Small Off-Diagonal Numbers, Pacific Journal of Mathematics (1972), 41 335-345.
3. R.J. Faudree and R.H. Schelp, All Ramsey numbers for cycles in graphs, Discrete Mathematics (1974), 8 313-329.
4. G.R. Hendry, Ramsey numbers for graphs with five vertices, Journal of Graph Theory (1989), 13 245-248.
5. C.J. Jayawardene and C.C. Rousseau, Some Ramsey numbers for a C5 vs small complete graphs, Preprint (See [7]).
6. V. Rosta, On a Ramsey type problem of J.A. Bondy and P. Erdos, I & II, Journal of Combinatorial Theory, Series B (1973), 15 94-120.
7. S.P. Radziszowski, Small Ramsey numbers, The Electronic J. Combin (1997), 1 1-29.
8. R.H. Schelp and R.J. Faudree, Some problems in Ramsey theory, LNM 642 Springer, Berlin, 1978, 500-515.