Infinite Sidon Sets Contained in Sparse Random Sets of Integers
From MaRDI portal
Publication:4602863
DOI10.1137/17M1114934zbMath1440.11010OpenAlexW2787766796WikidataQ101496418 ScholiaQ101496418MaRDI QIDQ4602863
Carlos Gustavo T.de A. Moreira, Yoshiharu Kohayakawa, Vojtěch Rödl, Sang June Lee
Publication date: 7 February 2018
Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1137/17m1114934
Probabilistic methods in extremal combinatorics, including polynomial methods (combinatorial Nullstellensatz, etc.) (05D40) Arithmetic combinatorics; higher degree uniformity (11B30)
Related Items (8)
Representation functions avoiding integers with density zero ⋮ Sidon sets for linear forms ⋮ No cubic integer polynomial generates a Sidon sequence ⋮ Infinite Sidon Sets Contained in Sparse Random Sets of Integers ⋮ On strong infinite Sidon and \(B_h\) sets and random sets of integers ⋮ On strong Sidon sets of integers ⋮ Infinite Sperner's theorem ⋮ On the independence number of non-uniform uncrowded hypergraphs
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- The number of \(B_3\)-sets of a given cardinality
- Extremal results for random discrete structures
- Combinatorial theorems in sparse random sets
- Hypergraph containers
- On the independence number of non-uniform uncrowded hypergraphs
- A dense infinite Sidon sequence
- Extremal uncrowded hypergraphs
- An infinite Sidon sequence
- Infinite Sidon sequences
- On sets of integers containing k elements in arithmetic progression
- Combinatorial theorems relative to a random set
- Infinite Sidon Sets Contained in Sparse Random Sets of Integers
- The number of Bh‐sets of a given cardinality
- On uncrowded hypergraphs
- 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
- Independent sets in hypergraphs
- On the Number ofBh-Sets
- B2-Folgen und verwandte Zahlenfolgen.
- On Certain Sets of Integers
- On a Problem of Sidon in Additive Number Theory and on Some Related Problems Addendum
- Counting configuration-free sets in groups
- Concentration of multivariate polynomials and its applications
This page was built for publication: Infinite Sidon Sets Contained in Sparse Random Sets of Integers