| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 9515581 | Journal of Combinatorial Theory, Series A | 2005 | 16 Pages |
Abstract
We obtain upper and lower bounds for the size of a largest family of 3-term arithmetic progressions contained in [0,n-1], no two of which intersect in more than one point. Such a family consists of just under a half of all of the 3-term arithmetic progressions contained in [0,n-1].
Keywords
Related Topics
Physical Sciences and Engineering
Mathematics
Discrete Mathematics and Combinatorics
Authors
Hayri Ardal, Tom C. Brown, Peter A.B. Pleasants,