On a Question of Erdős and Moser

@inproceedings{Sudakov2004OnAQ,
  title={On a Question of Erdős and Moser},
  author={Benny Sudakov and Endre Szemer{\'e}di and VU V.H.},
  year={2004}
}
For two finite sets of real numbers A and B, one says that B is sum-free with respect to A if the sum set {b + b | b, b ∈ B, b 6= b} is disjoint from A. Forty years ago, Erdős and Moser posed the following question. Let A be a set of n real numbers. What is the size of the largest subset B of A which is sum-free with respect to A? In this paper, we show that any set A of n real numbers contains a set B of cardinality at least g(n) ln n which is sum-free with respect to A, where g(n) tends to… CONTINUE READING
Highly Cited
This paper has 29 citations. REVIEW CITATIONS

From This Paper

Topics from this paper.

References

Publications referenced by this paper.
Showing 1-10 of 12 references

Generalized arithmetical progressions and sumsets

  • I. Z. RUZSA
  • Acta Math. Hungar. 65
  • 1994
Highly Influential
8 Excerpts

Foundations of a Structural Theory of Set Addition

  • G. A. FREIMAN
  • Transl. Math. Monogr. 37, Amer. Math. Soc…
  • 1973
Highly Influential
11 Excerpts

Additive Number Theory: Inverse Problems and the Geometry of Sumsets

  • M. B. NATHANSON
  • Grad. Texts in Math. 165, Springer, New York
  • 1996

Similar Papers

Loading similar papers…