论文信息 - Local Ramsey numbers for copies of cycles - 字舞流文

Local Ramsey numbers for copies of cycles

Abstract We prove that the 2-local Ramsey number R 2-loc ( nC 4 ) is equal to R ( nC 4 ). Moreover, R 2-loc ( nC 2 k +1 )= n (4 k +3)−2 for k ⩾2 or n ⩾2 and R 2-loc ( k ( C 3 ∪ C 4 ))=15 k −2 for k ⩾1.

[1] Zsolt Tuza,et al. Linear upper bounds for local Ramsey numbers , 1987, Graphs Comb..

[2] P. Erdös,et al. Ramsey Numbers for Cycles in Graphs , 1973 .

[3] Richard H. Schelp. Local and mean k -Ramsey numbers for complete graphs , 1997 .

[4] Miroslaw Truszczynski. Generalized local colorings of graphs , 1992, J. Comb. Theory, Ser. B.

[5] Iwao Sato,et al. Ramsey numbers for unions of some cycles , 1988, Discret. Math..

[6] Vojtech Rödl,et al. Local k-colorings of graphs and hypergraphs , 1987, J. Comb. Theory, Ser. B.

[7] Zsolt Tuza,et al. Ramsey numbers for local colorings , 1987, Graphs Comb..

[8] Tristan Denley. The Ramsey numbers for disjoint unions of cycles , 1996, Discret. Math..

[9] Joel Spencer,et al. Ramsey theorems for multiple copies of graphs , 1975 .

[10] Miroslaw Truszczynski,et al. A note on local colorings of graphs , 1997, Discret. Math..

[11] Zsolt Tuza,et al. On k-local and k-mean colorings of graphs and hypergraphs , 1993 .