Ramsey number r(s,t) denotes the minimum n such that every n-vertex graph contains a clique of order s or an independent set of order t.
In this paper we prove r(4,t) = Ω(t^3/log^4(t)) as t -> ∞
Ramsey number r(s,t) denotes the minimum n such that every n-vertex graph contains a clique of order s or an independent set of order t.
In this paper we prove r(4,t) = Ω(t^3/log^4(t)) as t -> ∞