Two proofs in combinatorial number theory-Reference-Cited by-同舟云学术

登录注册会员服务联系我们

Two proofs in combinatorial number theory

Published:1985 Issue:1 Volume:93 Page:185-188
ISSN:0002-9939
Container-title:Proceedings of the American Mathematical Society
language:en
Short-container-title:Proc. Amer. Math. Soc.

Author:

Nešetřil Jaroslav,Rödl Vojtěch

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.

Publisher

American Mathematical Society (AMS)

Subject

Applied Mathematics,General Mathematics

Link

http://www.ams.org/proc/1985-093-01/S0002-9939-1985-0766553-0/S0002-9939-1985-0766553-0.pdf

Reference3 articles.

1. On the multiplicative representation of integers;Erdős, P.;Israel J. Math.,1964

2. Some applications of Ramsey’s theorem to additive number theory;Erdős, P.;European J. Combin.,1980

3. 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.

Cited by 8 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Multiplicative Representations of Integers and Ramsey’s Theorem;Springer Proceedings in Mathematics & Statistics;2021

2. Ramsey Theory in the Work of Paul Erdős;The Mathematics of Paul Erdős II;2013

3. On the structure of sets of large doubling;European Journal of Combinatorics;2011-07

4. Erdős and the Integers;Journal of Number Theory;1999-11

5. Ramsey Theory in the Work of Paul Erdős;Algorithms and Combinatorics;1997

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线，采集、加工和组织学术论文而形成的新型学术文献查询和分析系统，可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容，当前同舟云学术共收录了国内外主流学术期刊6万余种，收集的期刊论文及会议论文总量共计约1.5亿篇，并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询！咨询电话：010-8811{复制后删除}0370

www.globalauthorid.com

TOP