二色Ramsey数R(5,12;2)的下界

THE LOWER BOUND OF TWO COLOR RAMSEY NUMBER R (5,12;2)

利用计算机，构造了既不含５－点团也不含１２－独立点集的１２３顶点循环图，从而求得了二色Ｒａｍｓｅｙ数Ｒ（５，１２；２）的新下界：Ｒ（５，１２；

One cyclic graph with 123 vertices is constructed by computers,which contains neither K 5 nor 12 . Hence, the result gained is that R (5,12;2)≥124.