A Lower Bound of Some Classical Ramsey Numbers R(3,t)

摘要

For positive integers s and t, the Ramsey number R(s, t) is the least positive integer n such that for every graph G of order n, either G contains Ks as a subgraph or G contains Kt as a subgraph. In this paper, we obtain lower bound of some Ramsey number R(3, t) .