A Note on a Ramsey-Type Problem for Sequences
نویسنده
چکیده
Two sequences {xi}i=1 and {yi}i=1 of distinct integers are similar if their entries are order-isomorphic. Let f(r,X) be the length of the shortest sequence Y such that any r-coloring of the entries of Y yields a monochromatic subsequence that is also similar to X. In this note we show that for any fixed non-monotone sequence X, f(r,X) = Θ(r2), otherwise, for a monotone X, f(r,X) = Θ(r).
منابع مشابه
Note on regular and coregular sequences
Let R be a commutative Noetherian ring and let M be a nitely generated R-module. If I is an ideal of R generated by M-regular sequence, then we study the vanishing of the rst Tor functors. Moreover, for Artinian modules and coregular sequences we examine the vanishing of the rst Ext functors.
متن کاملA note on the universal and canonically colored sequences
A sequence X = {xi}i=1 over an alphabet containing t symbols is t-universal if every permutation of those symbols is contained as a subsequence. Kleitman and Kwiatkowski showed that the minimum length of a t-universal sequence is (1−o(1))t2. In this note we address a related Ramsey-type problem. We say that an r-coloring χ of the sequence X is canonical if χ(xi) = χ(xj) whenever xi = xj . We pr...
متن کاملA note on "An interval type-2 fuzzy extension of the TOPSIS method using alpha cuts"
The technique for order of preference by similarity to ideal solution (TOPSIS) is a method based on the ideal solutions in which the most desirable alternative should have the shortest distance from positive ideal solution and the longest distance from negative ideal solution. Depending on type of evaluations or method of ranking, different approaches have been proposing to calculate distances ...
متن کاملRamsey-type Problem for an Almost Monochromatic
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2ck contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملRamsey - type problem for an almost monochromatic K 4 Jacob
In this short note we prove that there is a constant c such that every k-edge-coloring of the complete graph Kn with n ≥ 2 contains a K4 whose edges receive at most two colors. This improves on a result of Kostochka and Mubayi, and is the first exponential bound for this problem.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Electr. J. Comb.
دوره 21 شماره
صفحات -
تاریخ انتشار 2014