An application of graph theory to additive number theory

DOI10.1016/S0195-6698(85)80027-5zbMath0581.10029WikidataQ59701035 ScholiaQ59701035MaRDI QIDQ1068128

Paul Erdős, Noga Alon

Publication date: 1985

Published in: European Journal of Combinatorics (Search for Journal in Brave)

zbMATH Keywords

hypergraphs\(B_2\)-sequencesSidon sequencedistinct two-element sums

Mathematics Subject Classification ID

Hypergraphs (05C65) Special sequences and polynomials (11B83) Additive number theory; partitions (11P99)

Related Items (8)

On additive properties of general sequences ⋮ Distribution of Missing Sums in Sumsets ⋮ Point sets with distinct distances ⋮ On the structure of sets of large doubling ⋮ Embedding Graphs into Larger Graphs: Results, Methods, and Problems ⋮ Additive and multiplicative Sidon sets ⋮ Unnamed Item ⋮ Finding large co-Sidon subsets in sets with a given additive energy

Cites Work

• Unnamed Item
• Some applications of Ramsey's theorem to additive number theory
• On extremal problems of graphs and generalized graphs
• Linear problems in combinatorial number theory

This page was built for publication: An application of graph theory to additive number theory