Hostname: page-component-7b7567c8c-z4zkx Total loading time: 0 Render date: 2026-11-16T20:01:48.518Z Has data issue: false hasContentIssue false

PROBLEMS IN ZERO-SUM COMBINATORICS

Published online by Cambridge University Press:  01 June 1997

YAIR CARO
Affiliation:
Department of Mathematics, School of Education, University of Haifa—Oranim, Tivon 36006, Israel

Abstract

Core share and HTML view are not available for this content. However, as you have access to this content, a full PDF is available via the 'Save PDF' action button.

Let t(G, q) denote the smallest integer t such that the vertex set V of the graph G can be partitioned into t classes V(G)=[Cup ]ti=1Vi such that the number of edges in the induced subgraph 〈Vi〉 for 1[les ]i[les ]t, is divisible by q. Using an algebraic theorem due to Baker and Schmidt we prove that if q is a prime power then t(G, q) can be computed and a corresponding partition can be presented in a polynomial time.

Information

Type
Research Article
Copyright
The London Mathematical Society 1997