Two proofs in combinatorial number theory
HTML articles powered by AMS MathViewer
- by Jaroslav Nešetřil and Vojtěch Rödl
- Proc. Amer. Math. Soc. 93 (1985), 185-188
- DOI: https://doi.org/10.1090/S0002-9939-1985-0766553-0
- PDF | Request permission
Abstract:
The aim of this paper is to present a short combinatorial proof of a theorem of P. Erdős on multiplicative bases of integers. A solution of a problem of P. Erdős and D. J. Newman is also presented.References
- P. Erdős, On the multiplicative representation of integers, Israel J. Math. 2 (1964), 251–261. MR 181619, DOI 10.1007/BF02759742
- P. Erdős, Some applications of Ramsey’s theorem to additive number theory, European J. Combin. 1 (1980), no. 1, 43–46. MR 576765, DOI 10.1016/S0195-6698(80)80020-5 J. Nešetřil and V. Rödl, Simple proof of the existence of restricted Ramsey graphs by means of partite construction, Combinatorica 2 (1981), 199-202.
Bibliographic Information
- © Copyright 1985 American Mathematical Society
- Journal: Proc. Amer. Math. Soc. 93 (1985), 185-188
- MSC: Primary 11P68; Secondary 05A17
- DOI: https://doi.org/10.1090/S0002-9939-1985-0766553-0
- MathSciNet review: 766553