An Upper Bound for the Ramsey Number r(C6 , K9)

Authors

  • Alrhayyel A. A. M.
  • Bataineh M. S. A.
  • Alzaalig A. M. N.

Keywords:

Ramsey Number; Cycle Graph; Complete Graph.

Abstract

Let  Cm denote a cycle of length m and  Kn a complete graph of order n. In this paper we establish an upper bound for the Ramsey number of r(C6,K9) by proving that 41 £ r(C6,K9) £ 46.

Keywords: Ramsey Number; Cycle Graph; Complete Graph.

2000 Mathematics Subject Classification. Primary 05C38 ; secondary 05C35

Downloads

Published

2025-05-18

How to Cite

Alrhayyel A. A. M., Bataineh M. S. A., & Alzaalig A. M. N. (2025). An Upper Bound for the Ramsey Number r(C6 , K9). Jordan Journal of Mathematics and Statistics, 5(1), 75–84. Retrieved from https://jjms.yu.edu.jo/index.php/jjms/article/view/1145

Issue

Section

Articles