Geodesic
Some Progression-Free Partitions Constructed using Folkman's Method
Canadian mathematical bulletin, Tome 22 (1979) no. 1, pp. 87-91

Voir la notice de l'article provenant de la source Cambridge University Press

Almost from the day that B. L. van der Waerden [10] proved his now famous theorem on arithmetic progressions, mathematicians have been working to find a new or an improved constructive proof of that result, but without much success. 
Rabung, John R. Some Progression-Free Partitions Constructed using Folkman's Method. Canadian mathematical bulletin, Tome 22 (1979) no. 1, pp. 87-91. doi: 10.4153/CMB-1979-012-1
@article{10_4153_CMB_1979_012_1,
     author = {Rabung, John R.},
     title = {Some {Progression-Free} {Partitions} {Constructed} using {Folkman's} {Method}},
     journal = {Canadian mathematical bulletin},
     pages = {87--91},
     year = {1979},
     volume = {22},
     number = {1},
     doi = {10.4153/CMB-1979-012-1},
     url = {http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-012-1/}
}
TY  - JOUR
AU  - Rabung, John R.
TI  - Some Progression-Free Partitions Constructed using Folkman's Method
JO  - Canadian mathematical bulletin
PY  - 1979
SP  - 87
EP  - 91
VL  - 22
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-012-1/
DO  - 10.4153/CMB-1979-012-1
ID  - 10_4153_CMB_1979_012_1
ER  - 
%0 Journal Article
%A Rabung, John R.
%T Some Progression-Free Partitions Constructed using Folkman's Method
%J Canadian mathematical bulletin
%D 1979
%P 87-91
%V 22
%N 1
%U http://geodesic.mathdoc.fr/articles/10.4153/CMB-1979-012-1/
%R 10.4153/CMB-1979-012-1
%F 10_4153_CMB_1979_012_1

[1] 1. Berlekamp, E. R., A construction for partitions which avoid long arithmetic progressions, Canad. Math. Bull. 11 (1968), 409-414. Google Scholar

[2] 2. V. Chvátal, Some unknown van der Waerden numbers, Combinatorial Structures and Their Applications, Guy, R. K. et al. (editors) Gordon and Breach, 1970, 31-33. Google Scholar

[3] 3. P. Erdös, Some recent advances and current problems in number theory, Lectures on Modern Mathematics, Vol. 3, Saaty, T. L. (editor), Wiley, New York, 1965, 196-244. Google Scholar

[4] 4. Erdös, P. and Lovász, L., Problems and results on 3-chromatic hypergraphs and some related questions, Infinite and finite sets, Colloqu. Math. Soc. Janos Bolyai lo, Hajnol, Rado, and Sos (eds), North Holland, Amsterdam, 1975, 609-627 Google Scholar

[5] 5. P. Erdös and Rado, R., Combinatorial theorems on classifications of subsets of a given set, Proc. London Math. Soc, 2 (1952), 417-439. Google Scholar

[6] 6. Moser, L., On a theorem of van der Waerden, Canad. Math. Bull. 3 (1960), 23-25. Google Scholar

[7] 7. Rabung, J. R., On applications of van der Waerden's theorem, Math. Mag. 48 (1975), 142-148. Google Scholar

[8] 8. Schmidt, W. M., Two combinatorial theorems on arithemtic progressions, Duke Math. J. 29 (1962), 129-140. Google Scholar

[9] 9. Spencer, Joel, Ramsey's Theorem — a new lower bound, J. Combinatorial Theory 18 (1975), 108-115. Google Scholar

[10] 10. van der Waerden, B. L., Beweis einer Baudet'schen Vermutung, Nieuw Arch. Wisk., 15 (1927) 212-216. Google Scholar

[11] 11. Vegh, E., Hauptman, H., and Fisher, J., Tables of all Primitive Roots for Primes Less than 5000, Mathematics Research Center Report 70-5, Naval Research Laboratory, Washington, D.C. 1970. Google Scholar

[12] 12. Western, A. E. and Miller, J. C. P., Tables of Indices and Primitive Roots, Royal Society Mathematical Tables, Vol. 9, 1968, (University Press Cambridge). Google Scholar

Cité par Sources :