On weighted sums in Abelian groups
Discrete Mathematics
Testing subgraphs in large graphs
Random Structures & Algorithms - Special issue: Proceedings of the tenth international conference "Random structures and algorithms"
| Hi-index | 0.00 |
We derive some new results on the k-th barycentric Olson constants of abelian groups (mainly cyclic). This quantity, for a finite abelian (additive) group (G,+), is defined as the smallest integer @? such that each subset A of G with at least @? elements contains a subset with k elements {g"1,...,g"k} satisfying g"1+...+g"k=kg"j for some 1@?j@?k.