TEKNIK MENENTUKAN BILANGAN RAMSEY R(M, N) DENGAN M DAN N ADALAH 1, 2, DAN 3

ZALUKHU, AGUS FAJARMAN (2011) TEKNIK MENENTUKAN BILANGAN RAMSEY R(M, N) DENGAN M DAN N ADALAH 1, 2, DAN 3. Other thesis, Fakultas Matematika dan Ilmu Pengetahuan Alam.

Preview

PDF (TEKNIK MENENTUKAN BILANGAN RAMSEY R(M, N) DENGAN M DAN N ADALAH 1, 2, DAN 3) - Supplemental Material Available under License Creative Commons Public Domain Dedication. Download (38Kb) | Preview

Abstract

In every day life we are always confronted with what is called a graph, graph theory is a branch of knowledge of discrete mathematics. Graph theory is expressed in the form of the set (V, E), where V (vertex) is the set of points non-empty, and E (edge) is a side or a line connecting a pair of points in a graph. Given two graphs F and graph H, Ramsey numbers r (F, H) is the smallest positive integer n such that for every graph G with n points satisfy the condition G contains F as a subgraph, or the complement of G contains H as a subgraph. In this paper will discuss techniques to determine the Ramsey numbers r (m, n) with m and n are 1, 2, and 3. Of these techniques, we will obtain the value of r (1, n) = r (n, 1) = 1, r (2, n) = r (n, 2) = n, and r (3, 3) = 6 .

Actions (login required)

View Item