| 含有大的悬挂树图的Ramseygoodness结论(英文) |
| |
| 引用本文： | 宋洪雪.含有大的悬挂树图的Ramseygoodness结论(英文)[J].数学研究,2009,42(1). |
| |
| 作者姓名： | 宋洪雪 |
| |
| 作者单位： | 南京邮电大学理学院,江苏,南京,210046 |
| |
| 基金项目： | 国家自然科学基金，the Scientific Research Foundation of Nanjing University of Posts and Telecommunications |
| |
| 摘 要： | 设H是阶为n的连通图.在H的某一个顶点上悬挂一棵阶为j的树,得到图H_j,用H_j表示这样的图形族.本文证明:当j充分大时,有r(G,H_j)=(x(G)-1)(n+j-1)+s(G),其中x(G),s(G)分别表示图G的色数和色数剩余.
|
| 关 键 词： | Ramsey数 连通图 悬挂树 色数 |
A Ramsey Goodness Result for Graphs with Large Pendent Trees |
| |
| Song Hongxue.A Ramsey Goodness Result for Graphs with Large Pendent Trees[J].Journal of Mathematical Study,2009,42(1). |
| |
| Authors: | Song Hongxue |
| |
| Institution: | Song Hongxue (College of Science; Nanjing University of Posts and Telecommunications; Nanjing Jiangsu 210046); |
| |
| Abstract: | It gives the following Ramsey goodness conclusion. Let H be any connected graph of order n and let Hj be a graph of order n+j which is obtained from H by adding a pendent tree with j vertices, let Hj denote the class of all graphs Hj, if j is large enough, the Ramsey number r(G,Hj) satisfies r(G,Hj)=(X-1)(n+j-1)+s. |
| |
| Keywords: | Ramsey numbers connected graph pendent tree chromatic number |
| 本文献已被 维普 万方数据 等数据库收录！ |
|
