The number of B3-sets of a given cardinality

Domingos Dellamonica, Yoshiharu Kohayakawa, Sang June Lee, Vojtěch Rödl, Wojciech Samotij

Research output: Contribution to journalArticlepeer-review

Abstract

A set S of integers is a B3-set if all the sums of the form a1+a2+a3, with a1, a2 and a3∈S and a1≤a2≤a3, are distinct. We obtain asymptotic bounds for the number of B3-sets of a given cardinality contained in the interval [n]=(1, . . ., n). We use these results to estimate the maximum size of a B3-set contained in a typical (random) subset of [n] of a given cardinality. These results confirm conjectures recently put forward by the authors [On the number of Bh-sets, Combin. Probab. Comput. 25 (2016), no. 1, 108-127].

Original languageEnglish
Pages (from-to)44-76
Number of pages33
JournalJournal of Combinatorial Theory. Series A
Volume142
DOIs
StatePublished - 1 Aug 2016

Keywords

  • B-set
  • B-set
  • Random set
  • Sidon sequence
  • Sidon set

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Discrete Mathematics and Combinatorics
  • Computational Theory and Mathematics

Fingerprint

Dive into the research topics of 'The number of B3-sets of a given cardinality'. Together they form a unique fingerprint.

Cite this