Lower bounds of Ramsey numbers R(k,l)

Abstract

For positive integers k and l, the Ramsey number R(k,l) is the least positive integer n such that for every graph G of order n, either G contains K k as a subgraph or Ḡ contains K l as a subgraph. In this paper it is shown that Ramsey numbers R(k,l) ≥ 2kl - 3k - 3l + 6 when 3≤k≤l, and R(k,l) ≥ 2kl - 3k + 2l - 12 when 5≤k≤l. © International Association of Engineers.