| Full text | |
| Author(s): |
Dellamonica, Domingos, Jr.
;
Kohayakawa, Yoshiharu
;
Lee, Sang June
;
Roedl, Vojtech
;
Samotij, Wojciech
Total Authors: 5
|
| Document type: | Journal article |
| Source: | COMBINATORICS PROBABILITY & COMPUTING; v. 25, n. 1, p. 22-pg., 2016-01-01. |
| Abstract | |
A set A of positive integers is a B-h-set if all sums of the form a(1) + ... + a(h), with a(1), ..., a(h) is an element of A and a(1) <= ... <= a(h), are distinct. We provide asymptotic bounds for the number of B-h-sets of a given cardinality contained in the interval [n] = {1, ..., n}. As a consequence of our results, we address a problem of Cameron and Erdos (1990) in the context of B-h-sets. We also use these results to estimate the maximum size of a B-h-set contained in a typical (random) subset of [n] with a given cardinality. (AU) | |
| FAPESP's process: | 13/07699-0 - Research, Innovation and Dissemination Center for Neuromathematics - NeuroMat |
| Grantee: | Oswaldo Baffa Filho |
| Support Opportunities: | Research Grants - Research, Innovation and Dissemination Centers - RIDC |
| FAPESP's process: | 13/03447-6 - Combinatorial structures, optimization, and algorithms in theoretical Computer Science |
| Grantee: | Carlos Eduardo Ferreira |
| Support Opportunities: | Research Projects - Thematic Grants |