摘要
对于图G和图H ,Ramsey数r(G ,H)定义为最小正整数 p ,使得完全图Kp 用红、蓝两色作任意边着色后 ,总含红色子图G或蓝色子图H。以mG记m个图G的不相交并 ,Ck 记长度为k的圈 ,对于正整数m、n ,n≥m≥ 1 ,本文确定了Ramsey数r(mC3 ,nC4)。
For graphs G and H, the Ramsey number r(G,H)is defined to be the least integer p that after the edges of the complete graph K p are colored red and blue, either the red graph contains G as a subgraph or the blue graph contains H. Let mGdenote the union of m disjoint copies of G and C k denote the cycle of length k. The paper has determined the Ramsey numbers r(mC 3,nC 4) for n≥m≥1.
出处
《铁道师院学报》
2000年第2期4-8,共5页
Journal of Suzhou Railway Teachers College(Natural Science Edition)
