| （0,1）矩阵,组合竞赛与Ramsey问题 |
| |
| 引用本文： | 阚家海.（0,1）矩阵,组合竞赛与Ramsey问题[J].应用数学,1994,7(1):97-101. |
| |
| 作者姓名： | 阚家海 |
| |
| 作者单位： | 南京邮电学院 南京 |
| |
| 基金项目： | 国家自然科学基金，邮电部高校科研基金 |
| |
| 摘 要： | 本文提出用（０，１）矩阵的乘法来研究Ｒａｍｓｅｙ问题，并结合组合竞赛观点给出一大类经典Ｒａｍｓｅｙ数的构造性（算法性）下界。
|
| 关 键 词： | 矩阵 组合竞赛 Ramsey数 图论 |
(0,1) Matrices,Combinatorial Games and the Ramsey Problems |
| |
| Kan Jiahai.(0,1) Matrices,Combinatorial Games and the Ramsey Problems[J].Mathematica Applicata,1994,7(1):97-101. |
| |
| Authors: | Kan Jiahai |
| |
| Abstract: | In this paper,it is suggested to study the Ramsey problems by the multiplication of (0, 1) matrices,and combining the idea of combinatorial games,the constructible (algorithmic) lower bounds for a large class of the classical Ramsey numbers are shown. |
| |
| Keywords: | (0 1)Matrices Combinatorial games Ramsey numbers |
| 本文献已被 CNKI 维普 等数据库收录！ |
|
