BILANGAN RAMSEY R(K(1,11),K(2,2))

Main Authors: Marini, Veni, Sigit, Nugroho
Format: Thesis NonPeerReviewed Book
Bahasa: eng
Terbitan: , 2009
Subjects:
Online Access: http://repository.unib.ac.id/2666/1/SKRIPSI%20VENI%20MARINI.pdf
http://repository.unib.ac.id/2666/
Daftar Isi:
  • The study of Ramsey numbers were much did, ane of them was Parson (1975) in Radziszowski (2006) proved that 1 )) 2 , 2 ( ), , 1 ( ( + + ≤ n n K n K R . This research explorates the lower bound of )) 2 , 2 ( ), , 1 ( ( K n K R , for n = 11 by using directly proving method that investigate goodgraph with 12 vertex, 13 vertex, 14 vertex and 15 vertex. This research found there were goodgraph in graph F with 12 vertex, 13 vertex, 14 vertex and 15 vertex, so that 15 )) 2 , 2 ( ), 11 , 1 ( ( > K K R or 16 )) 2 , 2 ( ), 11 , 1 ( ( ≥ K K R . Based on Parson’s research (1975) in Radziszowski (2006) 16 )) 2 , 2 ( ), 11 , 1 ( ( ≤ K K R , so it can be concluded that 16 )) 2 , 2 ( ), 11 , 1 ( ( = K K R .