Two Proofs in Combinatorial Number Theory
From MaRDI portal
Publication:3222279
DOI10.2307/2044579zbMATH Open0557.10040OpenAlexW4247196797MaRDI QIDQ3222279FDOQ3222279
Authors: J. 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
Recommendations
- scientific article; zbMATH DE number 953246
- scientific article; zbMATH DE number 3993707
- scientific article; zbMATH DE number 493639
- Ein Beitrag zur additiven Zahlentheorie
- Ein Satz über Untermengen einer endlichen Menge.
- On additive bases
- Additive bases with many representations
- Eine obere Schranke für die Reichweite einer Extremalbasis zweiter Ordnung.
- Über die Basen der natürlichen Zahlenreihe.
- A generalization of a theorem of Erdős on asymptotic basis of order 2
Combinatorial aspects of partitions of integers (05A17) Other combinatorial number theory (11B75) Special sequences and polynomials (11B83)
Cited In (15)
- Infinitely many composite NSW numbers: an inductive proof
- Multiplicative representations of integers and Ramsey's theorem
- Two further combinatorial theorems equivalent to the 1-consistency of peano arithmetic
- Title not available (Why is that?)
- Inverse problems for representation functions in additive number theory
- Combinatorial properties of products of graphs
- On multiplicative bases in abelian groups
- Multiplicative representations of integers
- On the structure of sets of large doubling
- On multiplicative bases in commutative semigroups
- Some nonstandard Ramsey like applications
- Some applications of Ramsey's theorem to additive number theory
- Combinatorial Proofs of Fermat's, Lucas's, and Wilson's Theorems
- Erdős and the integers
- Tests and Proofs for Enumerative Combinatorics
This page was built for publication: Two Proofs in Combinatorial Number Theory
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3222279)
