Table of Contents
ISRN Algebra
Volume 2011, Article ID 926191, 10 pages
http://dx.doi.org/10.5402/2011/926191
Research Article

The Cycle-Complete Graph Ramsey Number π‘Ÿ ( 𝐢 9 , 𝐾 8 )

1Department of Mathematics, Yarmouk University, Irbid 21163, Jordan
2Department of Mathematics, Statistics, and Physics, Qatar University, Doha, Qatar

Received 11 May 2011; Accepted 14 June 2011

Academic Editor: R. L. Soto

Copyright © 2011 M. S. A. Bataineh et al. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

Linked References

  1. J. A. Bondy and P. Erdős, β€œRamsey numbers for cycles in graphs,” Journal of Combinatorial Theory. Series B, vol. 14, pp. 46–54, 1973. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  2. V. Nikiforov, β€œThe cycle-complete graph Ramsey numbers,” Combinatorics, Probability and Computing, vol. 14, no. 3, pp. 349–370, 2005. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  3. P. Erdős, R. J. Faudree, C. C. Rousseau, and R. H. Schelp, β€œOn cycle-complete graph Ramsey numbers,” Journal of Graph Theory, vol. 2, no. 1, pp. 53–64, 1978. View at Publisher Β· View at Google Scholar
  4. R. J. Faudree and R. H. Schelp, β€œAll Ramsey numbers for cycles in graphs,” Discrete Mathematics, vol. 8, pp. 313–329, 1974. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  5. V. Rosta, β€œOn a Ramsey-type problem of J. A. Bondy and P. Erdős. I, II,” Journal of Combinatorial Theory. Series B, vol. 15, pp. 94–120, 1973. View at Google Scholar
  6. J. S. Yang, Y. R. Huang, and K. M. Zhang, β€œThe value of the Ramsey number r(Cn,K4) is 3(n1)+1(n4),” The Australasian Journal of Combinatorics, vol. 20, pp. 205–206, 1999. View at Google Scholar Β· View at Zentralblatt MATH
  7. B. Bollobás, C. Jayawardene, J. Yang, Y. R. Huang, C. Rousseau, and K. M. Zhang, β€œOn a conjecture involving cycle-complete graph Ramsey numbers,” The Australasian Journal of Combinatorics, vol. 22, pp. 63–71, 2000. View at Google Scholar Β· View at Zentralblatt MATH
  8. I. Schiermeyer, β€œAll cycle-complete graph Ramsey numbers r(Cn,K6),” Journal of Graph Theory, vol. 44, no. 4, pp. 251–260, 2003. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH Β· View at MathSciNet
  9. A. Baniabedalruhman and M. M. M. Jaradat, β€œThe cycle-complete graph Ramsey number r(C7,K7),” Journal of Combinatorics, Information & System Sciences, vol. 35, pp. 293–305, 2010. View at Google Scholar
  10. M. M. M. Jaradat and A. Baniabedalruhman, β€œThe cycle-complete graph Ramsey number r(C8,K7),” International Journal of Pure and Applied Mathematics, vol. 41, no. 5, pp. 667–677, 2007. View at Google Scholar
  11. Y. Chen, T. C. E. Cheng, and Y. Zhang, β€œThe Ramsey numbers R(Cm,K7) and R(C7,K8),” European Journal of Combinatorics, vol. 29, no. 5, pp. 1337–1352, 2008. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  12. M. M. M. Jaradat and B. M. N. Alzaleq, β€œThe cycle-complete graph Ramsey number r(C8,K8),” SUT Journal of Mathematics, vol. 43, no. 1, pp. 85–98, 2007. View at Google Scholar Β· View at Zentralblatt MATH
  13. Y. Zhang and K. Zhang, β€œThe Ramsey number r(C8,K8),” Discrete Mathematics, vol. 309, no. 5, pp. 1084–1090, 2009. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  14. S. P. Radziszowski and K.-K. Tse, β€œA computational approach for the Ramsey numbers r(C4,Kn),” Journal of Combinatorial Mathematics and Combinatorial Computing, vol. 42, pp. 195–207, 2002. View at Google Scholar Β· View at Zentralblatt MATH
  15. C. J. Jayawardene and C. C. Rousseau, β€œThe Ramsey number for a cycle of length five vs. a complete graph of order six,” Journal of Graph Theory, vol. 35, no. 2, pp. 99–108, 2000. View at Publisher Β· View at Google Scholar Β· View at Zentralblatt MATH
  16. I. Schiermeyer, β€œThe cycle-complete graph Ramsey number r(C5,K7),” Discussiones Mathematicae. Graph Theory, vol. 25, no. 1-2, pp. 129–139, 2005. View at Google Scholar Β· View at Zentralblatt MATH
  17. S. P. Radziszowski, β€œSmall ramsey numbers,” Electronic Journal of Combinatorics, pp. 1–72, 2009. View at Google Scholar