Papers
Topics
Authors
Recent
2000 character limit reached

Rainbow-free 3-colorings of Abelian Groups

Published 1 Apr 2011 in math.CO | (1104.0194v1)

Abstract: A 3-coloring of the elements of an abelian group is said to be rainbow--free if there is no 3-term arithmetic progression with its members having pairwise distinct colors. We give a structural characterization of rainbow--free colorings of abelian groups. This characterization proves a conjecture of Jungi\'c et al. on the size of the smallest chromatic class of a rainbow-free 3-coloring of cyclic groups.

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (2)

Collections

Sign up for free to add this paper to one or more collections.