Jacob Fox, Cosmin Pohoata. Sets without k-term progressions can have many shorter progressions. Random Struct. Algorithms, 58(3):383-389, 2021. [doi]
@article{FoxP21,
title = {Sets without k-term progressions can have many shorter progressions},
author = {Jacob Fox and Cosmin Pohoata},
year = {2021},
doi = {10.1002/rsa.20984},
url = {https://doi.org/10.1002/rsa.20984},
researchr = {https://researchr.org/publication/FoxP21},
cites = {0},
citedby = {0},
journal = {Random Struct. Algorithms},
volume = {58},
number = {3},
pages = {383-389},
}