Marini, Veni and Sigit, Nugroho (2009) BILANGAN RAMSEY R(K(1,11),K(2,2)). Undergraduated thesis, Fakultas Matematika Dan Ilmu Pengetahuan Alam UNIB.
Text
SKRIPSI VENI MARINI.pdf - Bibliography Restricted to Registered users only Available under License Creative Commons GNU GPL (Software). Download (475kB) |
Abstract
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 .
Item Type: | Thesis (Undergraduated) |
---|---|
Subjects: | A General Works > AI Indexes (General) |
Divisions: | Faculty of Education > Department of Mathematics Education |
Depositing User: | 014 Abd. Rachman Rangkuti |
Date Deposited: | 01 Dec 2013 11:12 |
Last Modified: | 01 Dec 2013 11:12 |
URI: | http://repository.unib.ac.id/id/eprint/2666 |
Actions (login required)
View Item |