On Disjoint Chains of Subsets

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Sets of Almost Disjoint Subsets of a Set

The cardinal power of a set A is denoted by IA . Two sets A,, A2 are said to e almost disjoint if IA1 U A2I < lA i l (i = 1, 2) . e call B a transversal of the disjoint non-empty sets A,, (v E M) if Bc U A,, and B intersects each A,. (v E M) in a singleton . D1 An old and well known theorem of W . SIERPINSKI is that an infinite set of po-ver m contains more than m subsets of power m which are p...

متن کامل

Almost Disjoint Large Subsets of Semigroups

There are several notions of largeness in a semigroup S that originated in topological dynamics. Among these are thick , central , syndetic and piecewise syndetic. Of these, central sets are especially interesting because they are partition regular and are guaranteed to contain substantial combinatorial structure. It is known that in (N,+) any central set may be partitioned into infinitely many...

متن کامل

A Sperner Theorem on Unrelated Chains of Subsets

A theorem of Sperner [2] states that a collection of subsets of (l,..., n), no two ordered by inclusion, contains at most ( &,) sets. How many twoelement chains A cB of subsets of {I,..., n} can be found such that sets in different chains are not related? More generally, we seek to determinef,(n), defined to be the maximum m such that there exist subsets A(i,j) 5 {l,..., n}, 1 < i < m, 0 <j < k...

متن کامل

Disjoint subsets of integers having a constant sum

We prove that for position integers n, m and k, the set {1, 2, . . . , n} of integers contains k disjoint subsets having a constant sum m if and only if 2k − 1 ≤ m ≤ n(n+ 1)/(2k).

متن کامل

Generating all subsets of a finite set with disjoint unions

If X is an n-element set, we call a family G ⊂ PX a k-generator for X if every x ⊂ X can be expressed as a union of at most k disjoint sets in G. Frein, Lévêque and Sebő [10] conjectured that for n > 2k, the smallest k-generators for X are obtained by taking a partition of X into classes of sizes as equal as possible, and taking the union of the power-sets of the classes. We prove this conjectu...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Combinatorial Theory, Series A

سال: 2001

ISSN: 0097-3165

DOI: 10.1006/jcta.2000.3148