关于路和圈的3-色Ramsey数
CSTR:
作者:
作者单位:

同济大学

中图分类号:

O157.5

基金项目:

国家自然科学基金(11331003),浙江省自然科学基金(LY17F030020),浙江省嘉兴市科技局项目 (2016AY13011)


On Some Three-color Ramsey Numbers of Paths and Cycles
Author:
  • 摘要
  • | |
  • 访问统计
  • |
  • 参考文献 [10]
  • |
  • 相似文献 [20]
  • | | |
  • 文章评论
    摘要:

    对于给定的图G1,G2,…,Gk ,k≥2,k-色Ramsey数R(G1,G2,…,Gk)是指最小的正整数n,使得对n个点的完全图进行任意的k-边染色,总是存在某个染i色的单色图Gi,1≤i≤k.对G1 =G2= Pm,G3= Cn的情况进行了研究,得到了n较大时的3-色Ramsey数R(Pm , Pm,Cn)的准确值.

    Abstract:

    For given graphs G1,G2,…,Gk, where k≥2, the k-color Ramsey number R(G1, G2,…, Gk)is the smallest integer n such that if we arbitrarily color the edges of the complete graph on n vertices with k colors, there is always a monochromatic copy of Gi colored with color i, for some 1≤i≤k. In this note, we provide the exact value for 3color Ramsey R(Pm , Pm,Cn), where n is larger than m.

    参考文献
    [1] Bollobás B. Modern graph theory [M], Spring-Verlag, New York, 1998.
    [2] Radziszowski S P. Small Ramsey Numbers[J]. Electronic Journal of Combinatorics, 2017(3).
    [3] A. Gyárfs, M. Ruszinkó, G.N. Sák?zy, E. Szemerédi. Three color ramsey numbers for paths[J]. Combinatorica 2007 (27) 35–69.
    [4] F.S. Benevides and J. Skokan, The 3-Colored Ramsey Number of Even Cycles[J]. Journal of Combinatorial Theory, Series B, 2009 (99) 690-708.
    [5] Kohayakawa Y, Simonovits M, Skokan J. The 3-colored Ramsey number of odd cycles[J]. Electronic Notes in Discrete Mathematics, 2005(19)397-402.
    [6] T. Dzido, Multicolor Ramsey Numbers for Paths and Cycles[J]. Discussiones Mathematicae Graph Theory, 2005 (25) 57-65.
    [7] Dzido T, Kubale M, Piwakowski K. On some Ramsey and Turán-type numbers for paths and cycles[J]. The Electronic Journal of Combinatorics, 2006 (13) R55.
    [8] Zehui Shao, Xiaodong Xu, Xiaolong Shi, Linqiang Pana. Some three-color Ramsey numbers,R (P4,P5,C k) and R (P4,P6,C k) [J]. European Journal of Combinatorics, 2009(30)396-403.
    [9] T. Dzido and R. Fidytek, On Some Three Color Ramsey Numbers for Paths and Cycles[J]. Discrete Mathematics, 2009 (309) 4955-4958.
    [10] L. Caccetta and K. Vijayan , Maximal cycles in graphs[J]. Discrete mathematics, 1991(98) 1-7.
    引证文献
    网友评论
    网友评论
    分享到微博
    发 布
引用本文

陈明,李雨生.关于路和圈的3-色Ramsey数[J].同济大学学报(自然科学版),2018,46(07):0988~0990

复制
分享
文章指标
  • 点击次数:1004
  • 下载次数: 719
  • HTML阅读次数: 580
  • 引用次数: 0
历史
  • 收稿日期:2017-11-13
  • 最后修改日期:2018-05-15
  • 录用日期:2018-04-16
  • 在线发布日期: 2018-08-08
文章二维码