### Abstract

For a set of positive integers D, a fc-Term D-diffsequence is a sequence of positive integers ai < a2 <...< ak such that a< -Ai € D for all i 6 {2,3,...,k}. If k € Z+ and D € Z+ , define Δ(D,k) to be the least positive integer n such that every 2-coloring of {1,2,... ,n} contains a monochromatic fc-Term D-diffsequence. Bounds find exact values for Δ(D, k) for certain choices of D are given, improving on previous results.

Original language | English (US) |
---|---|

Pages (from-to) | 35-44 |

Number of pages | 10 |

Journal | Journal of Combinatorial Mathematics and Combinatorial Computing |

Volume | 105 |

State | Published - May 1 2018 |

### ASJC Scopus subject areas

- Mathematics(all)

## Fingerprint Dive into the research topics of 'Ramsey functions for sequences with restricted gaps'. Together they form a unique fingerprint.

## Cite this

Chokshi, K., Clifton, A., Landman, B. M., & Sawin, O. (2018). Ramsey functions for sequences with restricted gaps.

*Journal of Combinatorial Mathematics and Combinatorial Computing*,*105*, 35-44.