A dense infinite Sidon sequence
From MaRDI portal
Publication:1159234
DOI10.1016/S0195-6698(81)80014-5zbMath0474.10038WikidataQ105583795 ScholiaQ105583795MaRDI QIDQ1159234
Endre Szemerédi, János Komlós, Miklós Ajtai
Publication date: 1981
Published in: European Journal of Combinatorics (Search for Journal in Brave)
difference set; B2 sequences; independence number of graph; infinite Sidon sequences; maximal number of independent vertices; pairwise different sums
11B75: Other combinatorial number theory
05B10: Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.)
11B83: Special sequences and polynomials
Related Items
Coloring graphs with fixed genus and girth, Unnamed Item, Concentration of non‐Lipschitz functions and applications, The Ramsey number R(3, t) has order of magnitude t2/log t, On Brooks' Theorem for Sparse Graphs, On the monotonicity properties of additive representation functions, Broadcasting in random graphs, An upper bound on the Ramsey numbers R(3,k), On disjoint sets of differences, How to make a graph bipartite, Random constructions and density results, A note on the independence number of triangle-free graphs, Sidon sets in groups and induced subgraphs of Cayley graphs, On the density of \(B_2\)-bases, Probabilistic methods, Extremal uncrowded hypergraphs, A note on the independence number of triangle-free graphs. II, Independent sets in graphs with triangles, Fractional v. integral covers in hypergraphs of bounded edge size, Nearly perfect matchings in regular simple hypergraphs, An infinite Sidon sequence, Independence numbers of hypergraphs with sparse neighborhoods., Coloring graphs with sparse neighborhoods, \(B_ 2[g\) sequences whose terms are squares], Close-to-optimal and near-optimal broadcasting in random graphs, Erdős and the integers
Cites Work
