论文信息 - The properties of self-complementary graphs and new lower bounds for diagonal Ramsey numbers - 字舞流文

The properties of self-complementary graphs and new lower bounds for diagonal Ramsey numbers

Some properties of self-complementary graphs have been studied and 3 new lower bounds for diagonal Ramsey numbers have been obtained. They are: R(17, 17) ≥ 8917, R(18, 18) ≥ 11005, R(19, 19) ≥ 17885.

Haipeng Luo | Wenlong Su | Zhenchong Li

[1] Haipeng Luo,et al. New lower bounds of fifteen classical Ramsey numbers , 1999, Australas. J Comb..

[2] J. G. Kalbfleisch. Construction of Special Edge-Chromatic Graphs , 1965, Canadian Mathematical Bulletin.

[3] James P Burling,et al. Some lower bounds of the Ramsey numbers n(k, k) , 1972 .

[4] Haipeng Luo,et al. New lower bounds for classical Ramsey numbers R(5,13) and R(5,14) , 1999 .

[5] Haipeng Luo,et al. Lower bounds for multicolor classical Ramsey numbers , 1999 .

[6] James B. Shearer. Lower bounds for small diagonal ramsey numbers , 1986, J. Comb. Theory, Ser. A.

[7] Rudolf Mathon. Lower bounds for Ramsey numbers and association schemes , 1987, J. Comb. Theory, Ser. B.

[8] R. Greenwood,et al. Combinatorial Relations and Chromatic Graphs , 1955, Canadian Journal of Mathematics.