Author/Authors :
ALRHAYYEL, A. A. M. Yarmouk University - Department of Mathematics, Jordan , BATAINEH, M. S. A. Yarmouk University - Department of Mathematics, Jordan , ALZAALIG, A. M. N. Yarmouk University - Department of Mathematics, Jordan
Abstract :
Let C_m denote a cycle of length m and K_n a complete graph of order n. In this paper we establish an upper bound for the Ramsey number of r(C_6,K_9 ) by proving that 41≤ r(C_6, K_9) ≤46.
