AbstractFor integers b⩾0 and c⩾1, define fc(b) to be the least positive integer n such that for every 2-coloring of [1,n] there is a monochromatic sequence of the form {x,x+d,x+2d+b} where x and d are positive integers with d⩾c. Bialostocki, Lefmann, and Meerdink showed that for b even, 2b+10⩽f1(b)⩽132b+1, where the lower bound holds for b⩾10. We find upper and lower bounds for the more general function fc(b) which, for c=1, improve the aforementioned upper bound to ⌈9b/4⌉+9, and give the same lower bound of 2b+10. Results about fc(b) are used to find analogous results on a slightly different generalization of f1(b)
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...
AbstractLet V(n) be the minimum number of monochromatic 3-term arithmetic progressions in any 2-colo...
AbstractDesignate by W(k; t0, t1,…, tk−1) the smallest number m, such that if all the integers in th...
AbstractNumbers similar to those of van der Waerden are examined. We consider increasing sequences o...
AbstractVan der Waerden's classical theorem on arithmetic progressions states that for any positive ...
abstract: Van der Waerden’s Theorem asserts that for any two positive integers k and r, one may find...
AbstractRamsey functions similar to the van der Waerden numbers w(n) are studied. If A' is a class o...
AbstractA 2-coloring of the non-negative integers and a function h are given such that if P is any m...
The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has...
AbstractRamsey numbers similar to those of van der Waerden are examined. Rather than considering ari...
AbstractDenote by B(k, l) the least integer such that, if the numbers 1, 2, 3,…, B(k, l) + 1 are par...
AbstractFor positive integers n and k, let rk(n) be the size of the largest subset of {1,2,…,n} with...
AbstractFor each positive integer n, let the set of all 2-colorings of the interval [1, n]={1, 2, …,...
AbstractLet w(m,n) be the van der Waerden number in two colors. It is shown that w(m,n) is at least ...
Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, ...
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...
AbstractLet V(n) be the minimum number of monochromatic 3-term arithmetic progressions in any 2-colo...
AbstractDesignate by W(k; t0, t1,…, tk−1) the smallest number m, such that if all the integers in th...
AbstractNumbers similar to those of van der Waerden are examined. We consider increasing sequences o...
AbstractVan der Waerden's classical theorem on arithmetic progressions states that for any positive ...
abstract: Van der Waerden’s Theorem asserts that for any two positive integers k and r, one may find...
AbstractRamsey functions similar to the van der Waerden numbers w(n) are studied. If A' is a class o...
AbstractA 2-coloring of the non-negative integers and a function h are given such that if P is any m...
The van der Waerden number W(k,2) is the smallest integer n such that every 2-coloring of 1 to n has...
AbstractRamsey numbers similar to those of van der Waerden are examined. Rather than considering ari...
AbstractDenote by B(k, l) the least integer such that, if the numbers 1, 2, 3,…, B(k, l) + 1 are par...
AbstractFor positive integers n and k, let rk(n) be the size of the largest subset of {1,2,…,n} with...
AbstractFor each positive integer n, let the set of all 2-colorings of the interval [1, n]={1, 2, …,...
AbstractLet w(m,n) be the van der Waerden number in two colors. It is shown that w(m,n) is at least ...
Extremal Combinatorics is one of the central and heavily contributed areas in discrete mathematics, ...
For a set of positive integers $D$, a $k$-term $D$-diffsequence is a sequence of positive integers $...
AbstractLet V(n) be the minimum number of monochromatic 3-term arithmetic progressions in any 2-colo...
AbstractDesignate by W(k; t0, t1,…, tk−1) the smallest number m, such that if all the integers in th...