Sure monochromatic subset sums

• Autorzy: Noga Alon , Paul Erdős
• Języki publikacji: EN
• Wydawca: Institute of Mathematics Polish Academy of Sciences
• Czasopismo: Acta Arithmetica
• Rocznik: 1996
• Tom: 74
• Numer: 3
• Strony: 269-272

Daty

wydano

1996

otrzymano

1995-05-15

Twórcy

autor

Noga Alon

• Department of Mathematics, Raymond and Beverly Sackler Faculty of Exact Sciences, Tel Aviv University, Tel Aviv, Israel

autor

Paul Erdős

• Mathematical Institute of the Hungarian Academy of Sciences, P.O.B. 127, H-1364 Budapest, Hungary

Bibliografia

• [1] N. Alon and G. Freiman, On sums of subsets of a set of integers, Combinatorica 8 (1988), 297-306.
• [2] P. Erdős, Some of my recent problems in Combinatorial Number Theory, Geometry and Combinatorics, in: Graph Theory, Combinatorics and Applications, Proceedings of the Seventh Quadrennial International Conference on the Theory and Application of Graphs, Y. Alavi and A. Schwenk (eds.), Wiley Interscience, New York, 1995, 335-350.
• [3] G. Freiman, New analytical results in subset-sum problem, Discrete Math. 114 (1993), 205-218; Erratum, Discrete Math. 126 (1994), 447.
• [4] H. Halberstam and H. E. Richert, Sieve Methods, Academic Press, 1974.
• [5] A. Sárközy, Finite addition theorems, II, J. Number Theory 48 (1994), 197-218.