| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9513616 | Discrete Mathematics | 2005 | 7 Pages |
Abstract
Let m and r be positive integers. Define f(m,r) to be the least positive integer N such that for every coloring of the integers 1,â¦,N with r colors there exist monochromatic subsets B1 and B2 (not necessarily of the same color), each having m elements, such that (a) max(B1)-min(B1)⩽max(B2)-min(B2), and (b) max(B1)
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
David J. Grynkiewicz,