Hostname: page-component-586b7cd67f-t7fkt Total loading time: 0 Render date: 2024-11-30T01:31:12.612Z Has data issue: false hasContentIssue false
  • English
  • Français

PROBLEMS IN ZERO-SUM COMBINATORICS

Published online by Cambridge University Press:  01 June 1997

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

Abstract

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.

Type
Research Article
Information
Journal of the London Mathematical Society , Volume 55 , Issue 3 , June 1997 , pp. 427 - 434
Copyright
The London Mathematical Society 1997

Access options

Get access to the full version of this content by using one of the access options below. (Log in options will check for institutional or personal access. Content may require purchase if you do not have access.)