# On the number of generalized Sidon sets

@article{Balogh2018OnTN, title={On the number of generalized Sidon sets}, author={J{\'o}zsef Balogh and Lina Li}, journal={arXiv: Combinatorics}, year={2018} }

A set $A$ of nonnegative integers is called a Sidon set if there is no Sidon 4-tuple, i.e., $(a,b,c,d)$ in $A$ with $a+b=c+d$ and $\{a, b\}\cap \{c, d\}=\emptyset$. Cameron and Erd\H os proposed the problem of determining the number of Sidon sets in $[n]$. Results of Kohayakawa, Lee, R\" odl and Samotij, and Saxton and Thomason has established that the number of Sidon sets is between $2^{(1.16+o(1))\sqrt{n}}$ and $2^{(6.442+o(1))\sqrt{n}}$. An $\alpha$-generalized Sidon set in $[n]$ is a set…

## Tables from this paper

## One Citation

On the number of linear hypergraphs of large girth

- Mathematics, Computer ScienceJ. Graph Theory
- 2020

The main idea of the proof is to transfer the hypergraph enumeration problems to some graph enumeration Problems and then solve them asymptotically.

## References

SHOWING 1-10 OF 11 REFERENCES

On the number of linear hypergraphs of large girth

- Mathematics, Computer ScienceJ. Graph Theory
- 2020

The main idea of the proof is to transfer the hypergraph enumeration problems to some graph enumeration Problems and then solve them asymptotically.

The number of Sidon sets and the maximum size of Sidon sets contained in a sparse random set of integers

- Computer Science, MathematicsRandom Struct. Algorithms
- 2015

Estimating the number of Sidon sets of a given cardinality contained in [n] is based on estimating the random variable, where the maximum is taken over all Sidon subsets , and obtain quite precise information on for the whole range of m.

Hypergraph containers

- Mathematics
- 2012

We develop a notion of containment for independent sets in hypergraphs. For every $$r$$r-uniform hypergraph $$G$$G, we find a relatively small collection $${\mathcal C}$$C of vertex subsets, such…

On a problem of sidon in additive number theory, and on some related problems

- Mathematics
- 1941

To the memory of S. Sidon. Let 0 < a, < a,. .. be an infinite sequence of positive integers. Denote by f(n) the number of solutions of n=a i +a;. About twenty years ago, SIDON 1) raised the question…

On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum

- Mathematics
- 1944

In a note in this Journal [16 (1941), 212-215], Turan and I proved, among other results, the following : Let a l < a2 < . . . < a, < n be a sequence of positive integers such that the sums aj+a; are…

A pr 2 01 2 INDEPENDENT SETS IN HYPERGRAPHS

- Mathematics
- 2012

Many important theorems and conjectures in combinatorics, such as the the- orem of Szemeredi on arithmetic progressions and the Erd˝os-Stone Theorem in extremal graph theory, can be phrased as…

A theorem in finite projective geometry and some applications to number theory

- Mathematics
- 1938

A point in a finite projective plane PG(2, pn), may be denoted by the symbol (Xl, X2, X3), where the coordinates x1, X2, X3 are marks of a Galois field of order pn, GF(pn). The symbol (0, 0, 0) is…

On the number of graphs without 4-cycles

- Computer Science, MathematicsDiscret. Math.
- 1982

Large deviations for sums of partly dependent random variables

- Mathematics
- 2004

We use and extend a method by Hoeffding to obtain strong large deviation bounds for sums of dependent random variables with suitable dependency structure. The method is based on breaking up the sum…