Abstract
For m and k positive integers, define a k-term hm-progression to be a sequence of positive integers {x1,…,xk} such that for some positive integer d, xi + 1 − xi ∈ {d, 2d,…, md} for i = 1,…, k - 1. Let hm(k) denote the least positive integer n such that for every 2-colouring of {1, 2, …, n} there is a monochromatic hm-progression of length k. Thus, h1(k) = w(k), the classical van der Waerden number. We show that, for 1 ≤ r ≤ m, hm(m + r) ≤ 2c(m + r − 1) + 1, where c = ⌈m/(m − r)⌉. We also give a lower bound for hm(k) that has order of magnitude 2k2/m. A precise formula for hm(k) is obtained for all m and k such that k ≤ 3m/2.
Publisher
Cambridge University Press (CUP)
Reference13 articles.
1. Computer-generated van der Waerden partitions
2. Ramsey functions for quasi-progressions;Landman;Graphs Combin.
3. Ramsey functions associated with second order recurrences;Landman;J. Combin. Math. Combin. Comput.,1994
4. Beweis einer Baudetschen Vermutung;van der Waerden;Nieuw Arch. Wisk.,1927
5. Ramsey functions related to the van der waerden numbers
Cited by
3 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献