The Number of Subsets of Integers with Nok-Term Arithmetic Progression

DOI10.1093/imrn/rnw077zbMath1405.11009arXiv1605.03172OpenAlexW2963410422MaRDI QIDQ4612054

Hong Liu, Maryam Sharifzadeh, József Balogh

Publication date: 22 January 2019

Published in: International Mathematics Research Notices (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1605.03172

zbMATH Keywords

\(r\)-coloring\(k\)-term arithmetic progression

Mathematics Subject Classification ID

Extremal problems in graph theory (05C35) Extremal set theory (05D05) Ramsey theory (05D10) Arithmetic progressions (11B25) Arithmetic combinatorics; higher degree uniformity (11B30)

Related Items (8)

Integer colorings with no rainbow 3-term arithmetic progression ⋮ The number of \(k\)-dimensional corner-free subsets of grids ⋮ Four‐term progression free sets with three‐term progressions in all large subsets ⋮ The number of multiplicative Sidon sets of integers ⋮ The counting version of a problem of Erdős ⋮ On the number of points in general position in the plane ⋮ On the complexity of finding and counting solution-free sets of integers ⋮ Counting Gallai 3-colorings of complete graphs

This page was built for publication: The Number of Subsets of Integers with Nok-Term Arithmetic Progression