|
|
AN UPPER BOUND FOR THE RAMSEY NUMBER r(C_6, K_9 )
|
|
|
|
|
نویسنده
|
ALRHAYYEL A. A. M. ,BATAINEH M. S. A. ,ALZAALIG A. M. N.
|
منبع
|
jordan journal of mathematics and statistics - 2012 - دوره : 5 - شماره : 1 - صفحه:75 -84
|
چکیده
|
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.
|
|
|
آدرس
|
Yarmouk University, Department of Mathematics, Jordan, Yarmouk University, Department of Mathematics, Jordan, Yarmouk University, Department of Mathematics, Jordan
|
|
|
|
|
|
|
|
|
|
|
|
|
|
Authors
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|