On a generalization of Ramsey theory
نویسنده
چکیده
Classical Multi-color Ramsey Theory pertains to the existence of monochromatic subsets of structured multicolored sets such that the subsets have a given property or structure. This paper examines a generalization of Ramsey theory that allows the subsets to have specified groupings of colors. By allowing more than one color in subsets, the corresponding minimal sets for finite cases tend to be smaller. The author proposes poly-chromatic Ramsey Theory for the most general case and tuple-chromatic Ramsey Theory for the case in which the same number of colors is the maximum allowed for all of the subsets.
منابع مشابه
On Ramsey-type theorems
In [21], Frank Plumpton Ramsey proved what has turned out to be a remarkable and important theorem which is now known as Ramsey's theorem. This result is a generalization of the pigeonhole principle and can now be seen as part of a family of theorems of the same flavour. These Ramsey-type theorems all have the common feature that they assert, in some precise combinatorial way, that if we deal w...
متن کاملGeneralized Indiscernibles as Model-complete Theories
We define a mild generalization of classical Fraïssé classes, and in this context, we recover several old (often with novel proofs) and new facts about Ramsey classes and generalized indiscernibles in the sense of [12], [17], and other sources. Of particular novelty are: (1) a new and clearly model-theoretic proof of the equivalence of the Ramsey property and the extreme amenability of the auto...
متن کاملOn Generalization of Sturm-Liouville Theory for Fractional Bessel Operator
In this paper, we give the spectral theory for eigenvalues and eigenfunctions of a boundary value problem consisting of the linear fractional Bessel operator. Moreover, we show that this operator is self-adjoint, the eigenvalues of the problem are real, and the corresponding eigenfunctions are orthogonal. In this paper, we give the spectral theory for eigenvalues and eigenfunctions...
متن کاملA generalization of Ramsey theory for linear forests
Chung and Liu defined the d-chromatic Ramsey numbers as a generalization of Ramsey numbers by replacing a weaker condition. Let 1 < d < c and let t = (c d ) . Assume A1, A2, . . . , At are all d-subsets of a set containing c distinct colors. Let G1, G2, . . . , Gt be graphs. The d-chromatic Ramsey number denoted by rc d(G1, G2, . . . , Gt) is defined as the least number p such that, if the edge...
متن کاملThe Paris-Harrington Theorem
In Ramsey theory, very large numbers and fast-growing functions are more of a rule than an exception. The classical Ramsey numbers R(n,m) are known to be of exponential size: the original proof directly gives the upper bound R(n,m) ≤ ( m+n−2 n−1 ) , and an exponential lower bound is also known. For the van der Waerden numbers, the original proof produced upper bounds that were not even primitiv...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 38 شماره
صفحات -
تاریخ انتشار 1982