Arithmetic progressions of length three in subsets of a random set

0. Introduction. In 1936 Erdős and Turan [ET 36] asked whether for every natural number k and every positive constant α, every subset A of [n] = {0, 1, . . . , n − 1} with at least αn elements contains a k-term arithmetic progression provided n is sufficiently large with respect to α and k. This conjecture was resolved by Roth [Ro 53] for k = 3, whereas for general k it was settled in the affirmative by the outstanding theorem of Szemeredi [Sz 75]. A few years after Szemeredi’s paper was published, an entirely different proof of this result, based on ergodic theory, was given by Furstenberg [Fu 77]. Since then, the main open problem concerning the original question of Erdős and Turan has been to find better lower bounds for the size of A that guarantee the existence of arithmetic progressions of length k in A. Unfortunately, not much has been accomplished for k ≥ 4. The explicit estimates that follow from Szemeredi’s original proof are very poor and Furstenberg’s approach does not provide such bounds at all. The case k = 3 is much better understood. Roth’s original argument implies that it is enough to assume that |A| ≥ n/ log log n and the best lower bound to date has been given independently by HeathBrown and Szemeredi (see [H-B 87]), who showed that for some absolute constant c > 0 every subset of [n] with at least n/(log n) elements contains an arithmetic progression of length three, provided n is sufficiently large.

[1]  Paul Erdös,et al.  On Some Sequences of Integers , 1936 .

[2]  K. F. Roth On Certain Sets of Integers , 1953 .

[3]  E. Szemerédi Regular Partitions of Graphs , 1975 .

[4]  E. Szemerédi On sets of integers containing k elements in arithmetic progression , 1975 .

[5]  Joel H. Spencer Restricted Ramsey Configurations , 1975, J. Comb. Theory, Ser. A.

[6]  H. Furstenberg Ergodic behavior of diagonal measures and a theorem of Szemerédi on arithmetic progressions , 1977 .

[7]  Jaroslav Nesetril,et al.  Large minimal sets which force long arithmetic progressions , 1986, J. Comb. Theory, Ser. A.

[8]  Vojtech Rödl,et al.  The asymptotic number of graphs not containing a fixed subgraph and a problem for hypergraphs having no exponent , 1986, Graphs Comb..

[9]  V. Rödl,et al.  The number of sub-matrics of a given type in a Hadamard matrix and related results , 1987 .

[10]  Partite construction and Ramseyan theorems for sets, numbers and spaces , 1987 .

[11]  A. Thomason Pseudo-Random Graphs , 1987 .

[12]  D. R. Heath-Brown Integer Sets Containing No Arithmetic Progressions , 1987 .

[13]  Vojtech Rödl,et al.  The number of submatrices of a given type in a Hadamard matrix and related results , 1988, J. Comb. Theory, Ser. B.

[14]  Bernd Voigt,et al.  A sparse Graham-Rothschild theorem , 1988 .

[15]  Peter J. Cameron,et al.  Some sequences of integers , 1989, Discret. Math..

[16]  Vojtech Rödl,et al.  On ramsey families of sets , 1990, Graphs Comb..

[17]  Vojtech Rödl,et al.  The Algorithmic Aspects of the Regularity Lemma , 1994, J. Algorithms.

[18]  Yoshiharu Kohayakawa,et al.  The Induced Size-Ramsey Number of Cycles , 1995, Combinatorics, Probability and Computing.