Lower bounds for some Ramsey numbers (Q5905468)

The Ramsey number \(R(s,t)\) is the least number \(n\) such that every simple graph on \(n\) vertices contains either a clique of order \(s\) or an independent set of order \(t\). In this paper the authors presented that \(R(4,8)\geq 52\), \(R(3,14)\geq 64\), \(R(3,15)\geq 72\) and \(R(3,20)\geq 98\). It should be noted that better results \(R(3,14)\geq 66,\) \(R(3,15)\geq 73\) have been already obtained [cf. \textit{B. D. Mckay} and \textit{K. M. Zhang}, J. Graph Theory 16, No. 1, 99-105 (1992; Zbl 0758.05098)].