Abstract
A subsequence of the sequence $(1,2,...,n)$ is called a 3-$AP$-free sequence if it does not contain any three term arithmetic progression. By $r(n)$ we denote the length of the longest such 3-$AP$-free sequence. The exact values of the function $r(n)$ were known, for $n\leq 27$ and $41\leq n \leq 43$. In the present paper we determine, with a use of computer, the exact values, for all $n\leq 123$. The value $r(122)=32$ shows that the Szekeres' conjecture holds for $k=5$.
Publisher
The Electronic Journal of Combinatorics
Subject
Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science,Applied Mathematics,Discrete Mathematics and Combinatorics
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. The Equidistant Dimension of Graphs;Bulletin of the Malaysian Mathematical Sciences Society;2022-05-06
2. Novel structures in Stanley sequences;Discrete Mathematics;2016-02
3. Efficient Modular NIZK Arguments from Shift and Product;Cryptology and Network Security;2013