Discrete Math Seminar Spring 2009
Disjunctive and Selectivity Rado Numbers
Brenda Mammenga, Morningside College;
Mar 3
Given an equation L, the t-color Rado number for L is defined
to be the least integer n, provided that it exists, such that every coloring
Δ:{1,2,...,n} → {0,1,...,t-1} contains a monochromatic solution to L.
If such an integer n does not exist, we say that the t-color Rado number for
L is infinite. We will discuss results concerning two variations of this concept,
disjunctive Rado numbers and selectivity Rado numbers.