RAMSEY NUMBERS FOR CLASS OF EDGELESS, COMPLETE AND STAR GRAPHS

KALIRAJ K.1, NARESH KUMAR H.2

[PDF]

Abstract

For any graph class G of any two positive integers i and j, the Ramsey number RG(i; j) is the smallest integer such that every graph in G on atleast RG(i; j) vertices has a clique of size i or an independent set of size j. In this paper, we found the Ramsey numbers for the graph class of edgeless graphs, complete graphs, star graphs and class of all edgeless and complete graphs.

Keywords

Graph class and Ramsey numbers.