Document Type

Article

Publication Date

5-3-2019

Abstract

Let n m r t be positive integers and Δ : [n] → [r]. We say Δ is (m, r, t) - permissible if there exist t disjoint m-sets B1,…,Bt contained in [n] for which

  1. |Δ(Bi)| = 1 for each i = 1,2,…, t.
  2. max(Bi) < min(Bi+1) for each i = 1,2,…, t − 1, and
  3. max(Bi) − min(Bi) ≤ max(Bi+1) − max(Bi+1) for each i = 1, 2,…, t − 1.

Let f(m ,r, t) be the smallest such n so that all colorings Δ are (m, r, t)-permissible. In this paper, we show that f(2, 2, t) = 5t − 4.

Comments

Copyright © The authors. Released under the CC BY-ND license (International 4.0).

Share

COinS