TY - JOUR
AU - Caro, Yair
AB - 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)=⋓ti=1Vi such that the number of edges in the induced subgraph 〈Vi〉 for 1≤i≤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. © The London Mathematical Society
TI - Problems in Zero-Sum Combinatorics
JF - Journal of the London Mathematical Society
DO - 10.1112/S0024610797005152
DA - 1997-06-01
UR - https://www.deepdyve.com/lp/oxford-university-press/problems-in-zero-sum-combinatorics-y5g0lLiARc
SP - 427
EP - 434
VL - 55
IS - 3
DP - DeepDyve
ER -