共 50 条
Zero-sum delta-systems and multiple copies of graphs
被引:0
|作者:
Caro, Y
[1
]
Provstgaard, C
机构:
[1] Univ Haifa Oranim, Dept Math, IL-36006 Tivon, Israel
[2] Univ Aarhus, Dept Math Sci, DK-8000 Aarhus, Denmark
关键词:
zero-sum;
multiple copies;
D O I:
10.1002/(SICI)1097-0118(199910)32:2<207::AID-JGT9>3.0.CO;2-3
中图分类号:
O1 [数学];
学科分类号:
0701 ;
070101 ;
摘要:
A main result proved in this paper is the following. Theorem. Let G be a noncomplete graph on n vertices with degree sequence d(1) greater than or equal to d(2) greater than or equal to ... greater than or equal to d(n) and t 2 be a prime. Let m = gcd{t, d(i) - d(j); 1 less than or equal to i < j less than or equal to n} and set [GRAPHICS] Then R(tG,Z(t)) = t(n + d) - d, where R is the zero-sum Ramsey number. This settles, almost completely, problems raised in [Bialostocki & Dierker, J Graph Theory, 1994; Y. Care, J Graph Theory, 1991]. (C) 1999 John Wiley & Sons,Inc. J Graph Theory 32:207-216,1999.
引用
收藏
页码:207 / 216
页数:10
相关论文