A dense infinite Sidon sequence

DOI10.1016/S0195-6698(81)80014-5zbMath0474.10038OpenAlexW2062230178WikidataQ105583795 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)

Full work available at URL: https://doi.org/10.1016/s0195-6698(81)80014-5

zbMATH Keywords

difference set B2 sequences independence number of graph infinite Sidon sequences maximal number of independent vertices pairwise different sums

Mathematics Subject Classification ID

Other combinatorial number theory (11B75) Combinatorial aspects of difference sets (number-theoretic, group-theoretic, etc.) (05B10) Special sequences and polynomials (11B83)

Related Items

Additive combinatorics and graph theory, Independent transversals in bipartite correspondence-covers, Colouring graphs with sparse neighbourhoods: bounds and applications, Concentration of non‐Lipschitz functions and applications, Probabilistic methods, Probabilistic combinatorics and the recent work of Peter Keevash, Independent sets in graphs with triangles, Fractional v. integral covers in hypergraphs of bounded edge size, A (5,5)-Colouring of K_n with Few Colours, Close-to-optimal and near-optimal broadcasting in random graphs, Local Clique Covering of Claw-Free Graphs, Counting independent sets in triangle-free graphs, Nearly perfect matchings in regular simple hypergraphs, A greedy algorithm for \(B_h[g\) sequences], An infinite Sidon sequence, Packing nearly optimal Ramsey \(R(3,t)\) graphs, Bipartite induced density in triangle-free graphs, Long gaps between primes, On vertex independence number of uniform hypergraphs, Independence in connected graphs, The Ramsey number R(3, t) has order of magnitude t²/log t, On Brooks' Theorem for Sparse Graphs, Independence number of hypergraphs under degree conditions, Occupancy fraction, fractional colouring, and triangle fraction, Graph and hypergraph colouring via nibble methods: a survey, The Triangle-Free Process and the Ramsey Number 𝑅(3,𝑘), Unnamed Item, Infinite Sidon Sets Contained in Sparse Random Sets of Integers, Sparse hypergraphs with low independence number, Extremal uncrowded hypergraphs, Erdős and the integers, Infinite Sidon sequences, Independence numbers of hypergraphs with sparse neighborhoods., On the monotonicity properties of additive representation functions, Embedding Graphs into Larger Graphs: Results, Methods, and Problems, On generalized perfect difference sets constructed from Sidon sets, A note on the independence number of triangle-free graphs. II, Coloring graphs with fixed genus and girth, Strong Turán stability, On Costas sets and Costas clouds, Interpolating between bounds on the independence number, Near-optimal list colorings, Perfect difference sets constructed from Sidon sets, On strong infinite Sidon and \(B_h\) sets and random sets of integers, On strong Sidon sets of integers, Random constructions and density results, \(B_ 2[g\) sequences whose terms are squares], Separation Choosability and Dense Bipartite Induced Subgraphs, Revisiting a theorem by Folkman on graph colouring, Coloring graphs with sparse neighborhoods, On additive representation functions, Broadcasting in random graphs, Pseudorandom hypergraph matchings, Counting Independent Sets in Hypergraphs, Dense sumsets of Sidon sequences, An upper bound on the Ramsey numbers R(3,k), A note on the independence number of triangle-free graphs, On disjoint sets of differences, Sidon sets in groups and induced subgraphs of Cayley graphs, How to make a graph bipartite, On the density of \(B_2\)-bases

Cites Work