| 双星图的Ramsey数的上界 |
| |
| 引用本文： | 余培,李雨生.双星图的Ramsey数的上界[J].同济大学学报(自然科学版),2016,44(3):0469-0470. |
| |
| 作者姓名： | 余培 李雨生 |
| |
| 作者单位： | 同济大学数学系,同济大学数学系 |
| |
| 摘 要： | 对给定的两个图G和H,Ramsey数R(G,H)是最小的正整数N,使得对完全图KN的边任意红/蓝着色,则或者存在红色子图G,或者存在蓝色子图H.双星B(m,n)为直径是3,有两个中心顶点,其顶点度分别为m+1和n+1的树.得到,当nm时,R(B(m,n))2n+m+2;当n=m或n=m+1时,R(B(m,n))=2 m+n+2.
|
| 关 键 词： | Ramsey 数 树 双星 |
| 收稿时间： | 2015/4/24 0:00:00 |
| 修稿时间： | 2015/12/22 0:00:00 |
An Upper Bound for the Ramsey Numbers of Bistars |
| |
| YU Pei and LI Yusheng.An Upper Bound for the Ramsey Numbers of Bistars[J].Journal of Tongji University(Natural Science),2016,44(3):0469-0470. |
| |
| Authors: | YU Pei and LI Yusheng |
| |
| Institution: | Department of mathematics, Tongji University, Shanghai 200092, China and Department of mathematics, Tongji University, Shanghai 200092, China |
| |
| Abstract: | For two given graphs G and H, Ramsey number R(G,H) is the smallest integer N such that any red/blue edge-coloring of KN contains a red copy of G or a blue copy of H. Let a bistar B(m,n) be a tree of diameter three with two central vertices of degree m+1 and n 1, respectively. It is shown that R(B(m,n))<2n m 2 for n>m; and R(B(m,n))=2m n 2 for n=m or n=m 1. |
| |
| Keywords: | Ramsey number tree bistar |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《同济大学学报(自然科学版)》浏览原始摘要信息 |
| 点击此处可从《同济大学学报(自然科学版)》下载免费的PDF全文 |
|
