同济大学学报（自然科学版）2017，Vol.45Issue(4)：602-603,2.DOI:10.11908/j.issn.0253-374x.2017.04.020
书图和扇形图的Ramsey数
Ramsey Numbers of Books and Fans
摘要
Abstract
For given graphs G and H,Ramsey number R(G,H) is the smallest positive integer N such that any red/blue edge-coloring of KN contains either a red copy of G or a blue copy of H.Denote by G+H the graph obtained from disjoint G and H by adding edges connecting G and H completely.Let Bm=K2+mK1 and Fn =K1+nK2.It is shown that R (Bm,Fn)=4n+1 for n≥max{2,3m-2};and R(F2,K2,n)=2n+3 for n≥38.关键词
Ramsey数/Ramsey goodness/书图/扇形图Key words
Ramsey number/Ramsey goodness/book/fan分类
数理科学引用本文复制引用
刘猛,李雨生..书图和扇形图的Ramsey数[J].同济大学学报（自然科学版）,2017,45(4):602-603,2.
