| Ramsey数R(k,l;r)的构造性下界 |
| |
| 引用本文： | 阚家海. Ramsey数R(k,l;r)的构造性下界[J]. 南京邮电大学学报(自然科学版), 1992, 0(3) |
| |
| 作者姓名： | 阚家海 |
| |
| 作者单位： | 南京邮电学院基础课部 |
| |
| 基金项目： | 邮电部高等院校中青年教师科研基金 |
| |
| 摘 要： | 确定Ramsey数的构造性下界是组合数学中很有意义而又非常困难的课题,迄今仅有个别结果。本文将研究一类组合竞赛,给出任意Ramsey数R(k,l;r)的构造性(算法性)下界。
|
| 关 键 词： | 拉姆塞数 组合数学 超图 构造性方法 下界 |
The Constructive Lower Bounds for the Ramsey Numbers R(k,l;r) |
| |
| Kan Jiahai. The Constructive Lower Bounds for the Ramsey Numbers R(k,l;r)[J]. JJournal of Nanjing University of Posts and Telecommunications, 1992, 0(3) |
| |
| Authors: | Kan Jiahai |
| |
| Affiliation: | Department of Basic Courses |
| |
| Abstract: | The constructive lower bounds for the classic.bi-colored Ramsey numbers R(k,l;r) are obtained.In the special case of k=l and r =2, the results here enormously improve that of P. Frankl and R.M. Wilson. Moreover, the lower bound,of R(l , l ;2) proved in this paper by the constructive method is a little better even than the classic result of P. Erdos which is.however,obtained with the probabilistic argument(i. e. existence proof). |
| |
| Keywords: | Ramsey numbers Combinatorial mathematics Hypergraph Constructive method Lower bounds |
| 本文献已被 CNKI 等数据库收录！ |
|
