Abstract :
The Ramsey number R(G1, G2) is the smallest integer p such that for any graph G on p vertices either G contains G1or __G contains G2, where __ G denotes the complement of G. LetR (m, n) = R(Km,Kn ). Some new upper and lower bound formulas are obtained forR (G1, G2) and R(m, n).
