| Ramsey数R(K_3,K_(16)-e)的一个下界 |
| |
| 引用本文： | 谢建民,姚兵,毛耀忠.Ramsey数R(K_3,K_(16)-e)的一个下界[J].数学的实践与认识,2012,42(5):203-208. |
| |
| 作者姓名： | 谢建民 姚兵 毛耀忠 |
| |
| 作者单位： | 1. 兰州城市学院数学学院,甘肃兰州,730070
2. 西北师范大学数学与信息科学学院,甘肃兰州,730070 |
| |
| 摘 要： | 图论方法是研究Ramsey理论中最常用的方法,80多年的研究产生了大量的成果.Ramsey数R(G,H)是这样的最小正整数n,使得完全图K_n的边的任何一种红、蓝染色都会有一个红色边子图G,或者有一个蓝色边子图H.本文找到Ramsey数R(K_3,K_(16-e))的一个下界.
|
| 关 键 词： | Ramsey数 图 着色 |
A New Lower Bound of Ramsey Number R(K3,16- e) |
| |
| XIE Jian-min
,
YAO Bing
,
MAO Yao-zhong.A New Lower Bound of Ramsey Number R(K3,16- e)[J].Mathematics in Practice and Theory,2012,42(5):203-208. |
| |
| Authors: | XIE Jian-min YAO Bing MAO Yao-zhong |
| |
| Institution: | 1 (1.College of Mathematics of Lanzhou City University,Lanzhou 730070,China) (2.College of Mathematics and Information Science,Northwest Normal University,Lanzhou 730070,China) |
| |
| Abstract: | Graphs offer a generalized approach to classical Ramsey theory which over the eighty years has turned out to be quite fruitful.The Ramsey number R（G,H） gives the solution to the party problem.The basic notion of graph Ramsey theory is:If for every edge-coloring of Kn with colors red and blue,a red G or a blue H occurs as a subgraph.We find a lower bound of R(K3,K16-e) by computer associated. |
| |
| Keywords: | Ramsey number graphs colorings |
| 本文献已被 CNKI 万方数据 等数据库收录！ |
|
