论文信息 - Difference Ramsey Numbers and Issai Numbers - 字舞流文

Difference Ramsey Numbers and Issai Numbers

We present a recursive algorithm for finding good lower bounds for the classical Ramsey numbers. Using notions from this algorithm we then give some results for generalized Schur numbers, which we call Issai numbers.

Aaron Robertson

[1] Fan Chung Graham. On the ramsey numbers N(3, 3, ...3;2) , 1973, Discret. Math..

[2] Geoffrey Exoo. On Two Classical Ramsey Numbers of the Form R(3, n) , 1989, SIAM J. Discret. Math..

[3] Fan Rong K. Chung. On the ramsey numbers N(3,3,...3;2) , 1973 .

[4] Charles M. Grinstead,et al. On the Ramsey numbers, R(3,8) and R(3,9) , 1982 .

[5] J. Spencer. Ramsey Theory , 1990 .

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

[7] Fan Chung Graham,et al. A survey of bounds for classical Ramsey numbers , 1983, J. Graph Theory.

[8] Jack E. Graver,et al. Some graph theoretic results associated with Ramsey's theorem* , 1968 .

[9] Donald L. Kreher,et al. On (3, k) Ramsey graphs: Theoretical and computational results , 1988 .

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