摘要
<正> § 1. IntroductionThe determination of the Ramsey numbers is a main problem in the studyof the combinatorial mathematics and graph theory. However, it is still avery difficult unsolved problem to date. Hence evaluation of the lower boundof the Ramsey numbers seems (to be) very necessary.Abbott, H.L.[1] showed that a special formula of the lower bound ofthe Ramsey numbers: R(2~n+1,2~n+1)≥5~n+1. Erd(o|¨)s, P. and Spencer,J.[2]obtained that a formula of the lower bound of the Ramsey numbers R(s,t)
