Independent arithmetic progressions in clique-free graphs on the natural numbers (Q5929832): Difference between revisions

The main result of this paper is that if \(k\geq 3\) and \(\ell\geq 3\), and if \(G\) is any \(K_k\)-free graph with vertex set \(\mathbb{N}\), then there exists an independent set of vertices of \(G\) which contains an arithmetic progression of length \(\ell\) and its common difference. This result can be viewed as a common generalization of the classical theorems of Ramsey and van der Waerden.