On the Number ofBh-Sets
Publication:5364267
DOI10.1017/S0963548315000206zbMath1371.11063DBLPjournals/cpc/DellamonicaKLRS16OpenAlexW2573899441WikidataQ101496356 ScholiaQ101496356MaRDI QIDQ5364267
Yoshiharu Kohayakawa, Domingos jun. Dellamonica, Wojciech Samotij, Sang June Lee, Vojtěch Rödl
Publication date: 4 October 2017
Published in: Combinatorics, Probability and Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s0963548315000206
Other combinatorial number theory (11B75) Asymptotic enumeration (05A16) Special sequences and polynomials (11B83) Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40)
Related Items (7)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- Theorems in the additive theory of numbers
- On the number of graphs without 4-cycles
- On finite Sidon sequences
- The density of \(B_ h[g\) sequences and the minimum of dense cosine sums]
- Counting sum-free sets in abelian groups
- A complete annotated bibliography of work related to Sidon sequences
- The number of squares and Bh[g sets]
- ON SIDON SETS IN A RANDOM SET OF VECTORS
- On sets of integers containing k elements in arithmetic progression
- On the Size of Finite Sidon Sequences
- Arithmetic progressions of length three in subsets of a random set
- The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers
- A remark on B4-Sequences
- B2-Folgen und verwandte Zahlenfolgen.
- On Certain Sets of Integers
- On a Problem of Sidon in Additive Number Theory, and on some Related Problems
- On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
- New upper bounds for finite \(B_h\) sequences
This page was built for publication: On the Number ofBh-Sets