Two Proofs in Combinatorial Number Theory

DOI10.2307/2044579zbMath0557.10040OpenAlexW4247196797MaRDI QIDQ3222279

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

Publication date: 1985

Published in: Proceedings of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2044579

zbMATH Keywords

Ramseytheoremmultiplicative bases of integersB2-sequenceBj-sequenceproduct of two elements

Mathematics Subject Classification ID

Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)

Related Items (9)

Multiplicative representations of integers ⋮ Multiplicative Representations of Integers and Ramsey’s Theorem ⋮ On the structure of sets of large doubling ⋮ Erdős and the integers ⋮ On multiplicative bases in commutative semigroups ⋮ Combinatorial properties of products of graphs ⋮ On multiplicative bases in abelian groups ⋮ Inverse Problems for Representation Functions in Additive Number Theory ⋮ Some nonstandard Ramsey like applications

This page was built for publication: Two Proofs in Combinatorial Number Theory