Year: 2017
Type: article
Abstract: The problem of determining the maximum cardinality of a subset containing no arithmetic progressions of length k in a given set of size n is considered. It is proved that it is sufficient, in a certain sense, to consider the interval [1,..., n ]. The study continues the work of Komlós, Sulyok, and Szemerédi.
Source: Mathematical Notes
Author: A. S. Semchankau
Institution: Moscow Institute of Physics and Technology
Language: English
Subfield: Discrete Mathematics and Combinatorics
Field: Mathematics
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2765867436