Title of article
Almost disjoint families of 3-term arithmetic progressions
Author/Authors
Ardal، نويسنده , , Hayri and Brown، نويسنده , , Tom C. and Pleasants، نويسنده , , Peter A.B.، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2005
Pages
16
From page
75
To page
90
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
Almost disjoint , Arithmetic progression
Journal title
Journal of Combinatorial Theory Series A
Serial Year
2005
Journal title
Journal of Combinatorial Theory Series A
Record number
1530950
Link To Document