The cycle-complete graph Ramsey number r(C 8, K 8)

SUT Journal of Mathematics

Volumn 43, Issue 1, 2007, Pages 85-98

  Jaradat, M M M ^a,b   Alzaleq, B M N ^a  

^a YARMOUK UNIVERSITY   (Jordan)

^b QATAR UNIVERSITY   (Qatar)

Author keywords

Complete graph; Cycle graph; Independent set; Ramsey number

Indexed keywords

EID: 77957654170     PISSN: 09165746     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Article

References (14)

1. A. Baniabedalruhman, On Ramsey number for cycle-complete graphs, M.Sc. Thesis, Yarmouk University, 2006.
2. B. Bollobás, C. J. Jayawardene, Z. K. Min, C. C. Rousseau, H. Y. Ru, and J. Yang, On a conjecture involving cycle-complete graph Ramsey numbers, Australas. J. combin., 22 (2000), 63-72.
3. J. A. Bondy and P. Erdös, Ramsey numbers for cycles in graphs, Journal of Combinatorial Theory, Series B, 14 (1973), 46-54.
4. P. Erdös, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, On cycle-complete graph Ramsey numbers, J. Graph Theory, 2 (1978), 53-64.
5. R. J. Faudree and R. H. Schelp, All Ramsey numbers for cycles in graphs, Discrete Mathematics, 8 (1974), 313-329.
6. G. R. Hendry, Ramsey numbers for graphs with five vertices, Journal of Graph Theory, 13 (1989), 245-248.
7. 7). To appear.
8. C. J. Jayawardene and C. C. Rousseau, The Ramsey number for a cycle of length five versus a complete graph of order six. J. Graph Theory, 35 (2000), 99-108.
9. V. Nikiforov, The cycle-complete graph Ramsey numbers. Combin. Probab. Comput. 14 (2005), no.3, 349-370.
10. n). J. Comb. Math. Comb. Comput., 42 (2002), 195-207.
11. V. Rosta, On a Ramsey type problem of J. A. Bondy and P. Erdos, I and II, Journal of Combinatorial Theory, Series B 15 (1973), 94-120.
12. 6), J. Graph Theory, 44 (2003), 251-260.
13. 7), Discus- siones Mathematicae Graph Theory 25 (2005) 129-139.
14. 4) is 3(n - 1) + 1 (n ≥ 4), Ausralas. J. Combin., 20 (1999), 205-206.