Some properties of Ramsey numbers (Q1433193)

For any positive integers \(k\) and \(l\), the Ramsey number \(r(k,l)\) is defined as the smallest integers such that each graph with at least \(r(k,l)\) vertices contains a clique of order \(k\) or an independent set with \(l\) vertices. Lower bounds for \(r(\prod_{i=1}^m k_i +1, \prod_{i=1}^m l_i +1)\) and \(r(\sum_{i=1}^m k_i +1,\sum_{j=1}^n p_j +1)\), where \(m,n>1\), \(k_1,k_2,\dots,k_m, l_1,l_2,\dots,l_m,p_1,p_2,\dots,p_n\) are positive integers, are established. It is shown that utilizing the obtained inequalities it is possible to derive some upper and lower bounds of Ramsey numbers.