Rado Partition Theorem for Random Subsets of Integers

Proceedings of the London Mathematical Society

Volumn 74, Issue 3, 1997, Pages 481-502

  Rödl, Vojtech ^a   Ruciński, Andrzej ^b  

^a EMORY UNIVERSITY   (United States)

^b ADAM MICKIEWICZ UNIVERSITY   (Poland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0043005751     PISSN: 00246115     EISSN: None     Source Type: Journal    
DOI: 10.1112/S0024611597000178     Document Type: Article

References (10)

1. B. BOLLOBAS, Random graphs (Academic Press, New York, 1985).
2. P. ERDOS and P. TURAN, ‘On some sequences of integers’, J. London Math. Soc. 11 (1936) 261–264.
3. P. FRANKL R. GRAHAM and V. RÖDL, ‘Quantitative theorems for regular systems of equations’, J. Combin. Theory Ser. A 47 (1988) 246–261.
4. R. GRAHAM V. RÖDL, and A. RUCIŃSKI, ‘On Schur properties of random subsets of integers’, J. Number Theory, to appear.
5. S. JANSON, ‘Poisson approximation for large deviations’, Random Structures Algorithms 1 (1990) 221–229.
6. R. RADO, ‘Note on combinatorial analysis’, Proc. London Math. Soc. (2) 48 (1930) 122–160.
7. V. RÖDL and A. RUCIŃSKI, ‘Threshold functions for Ramsey properties’, J. Amer. Math. Soc. 8 (1995) 917–942.
8. I. SCHUR, Über die Kongruenz xm + ym = zm (mod p)’, Jber. Deutsch. Mat. Verein. 25 (1916) 114–117.
9. E. SZEMEREDI, ‘On sets of integers containing no k elements in arithmetic progression’, Acta Arith. 27 (1975) 199–245.
10. B. L. VAN DER WAERDEN, ‘Beweis einer Baudetschen Vermutung’, Nieuw Arch. Wisk. 15 (1927) 212–216.