A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
On zero-sum turan problems of Bialostocki and Dierker
1992
Journal of the Australian Mathematical Society
Assume G is a graph with m edges. By T(n, G) we denote the classical Turan number, namely, the maximum possible number of edges in a graph H on n vertices without a copy of G . Similarly if G is a family of graphs then H does not have a copy of any member of the family. A Z k -colouring of a graph G is a colouring of the edges of G by Z k , the additive group of integers modulo k , avoiding a copy of a given graph H, for which the sum of the values on its edges is 0 (mod k). By the Zero-Sum
doi:10.1017/s1446788700036569
fatcat:g3jhwm3lu5cqtgjodik4dgmmuu