Abstract
Consider the set and an equation . The rainbow number of for , denoted , is the smallest number of colors such that for every exact -coloring of , there exists a solution to with every member of the solution set assigned a distinct color. This paper focuses on linear equations and, in particular, establishes the rainbow number for the equations for and . The paper also establishes a general lower bound for .
Connections
Explore this paper’s authors, topics and related work.
Building this map preview
BZPEER is loading the nearby papers, people, topics and institutions for this page.
Reviews 0
Write a review
No reviews yet.
Discussion 0
Add a comment
No comments yet.