Erdős Problem #201 — Progression-free subsets of arbitrary integer sets
For integers and , call a subset progression-free if it contains no distinct integers of the form , where and . For each finite , let be the largest cardinality of a progression-free subset of . Define
Thus is the largest size guaranteed to be available in every -element set of integers. The questions are to determine understand its relation to and, for , decide whether
Background
The comparison asks whether the interval is asymptotically as difficult as the worst-positioned -element set of integers for finding a large progression-free subset. The inequality follows because the interval is one of the sets over which the minimum defining is taken. The problem was first investigated by Riddell; Erdős and Graham later recorded the comparison and asked whether the ratio for three-term progressions tends to . Erdős Problem #201 Erdős and Graham (1979)
References
UnsolvedMath, Erdős Problems set, ULAM AI, licensed CC BY 4.0.
Progress summary
Nothing recorded yet. Refresh searches the literature and the public web for attempts on this problem, and writes the first summary here.
Solutions 0
No solutions have been posted yet.