Another 3-Part Sperner Theorem

نویسنده

  • Karen Meagher
چکیده

In this paper, we prove a higher order Sperner theorem.These theorems are stated after some notation and background results are introduced. For i, j positive integers with i ≤ j, let [i, j] denote the set {i, i + 1, . . . , j}. For k, n positive integers, set ( [n] k ) = {A ⊆ [1, n] : |A| = k}. A system A of subsets of [1, n] is said to be k-set system if A ⊆ ( [n] k ) . Two subsets A, B are incomparable if A 6⊆ B and B 6⊆ A. A set system on an n-set A is said to be a Sperner set system, if any two distinct sets in A are incomparable. Sperner’s Theorem is concerned with the maximal cardinality of Sperner set systems as well as with the structure of such maximal systems.

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

ثبت نام

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

منابع مشابه

AZ-Identities and Strict 2-Part Sperner Properties of Product Posets

One of central issues in extremal set theory is Sperner's theorem and its generalizations. Among such generalizations is the best-known BLYM inequality and the Ahlswede--Zhang (AZ) identity which surprisingly generalizes the BLYM into an identity. Sperner's theorem and the BLYM inequality has been also generalized to a wide class of posets. Another direction in this research was the study of mo...

متن کامل

All Maximum Size Two-Part Sperner Systems: In Short

Katona [6] and Kleitman [8] independently observed that the statement of the Sperner theorem remains unchanged if the conditions are relaxed in the following way. Let X = X1 ∪X2 be a partition of the underlying set X, |Xi| = ni, n1 + n2 = n (with n1 n2). We say that F is a two-part Sperner family if E, F ∈ F, E F ⇒ ∀i : (F \ E) ⊂ Xi. It was proved that the size of a two-part Sperner family cann...

متن کامل

C. 3i Working Paper Alfred P. Sloan School of Management a Unified Approach to Some Combinatorial Lemmas in Topology a Unified Approach to Some Combinatorial Lemmas in Topology

Part II of this study uses the path-following theory of labelled V-complexes developed in Part I to provide constructive algorithmic proofs of a variety of combinatorial lenmas in topology. \Je demonstrate two new dual lemmas on the n-dimensional cube, and use a Generc.lized S ^erner Lemma to prove a gener lization of the Knaster-Kuratowski-y.azurkiewicz Covering Lemma on the simplex. We also s...

متن کامل

Another Simple Proof of a Theorem of Milner

In this note we give a short proof of a theorem of Milner concerning intersecting Sperner systems. An intersecting Sperner system on [n] = {1, . . . , n} is a collection of subsets of [n], no pair of which is either disjoint or nested. Milner [2] proved that an intersecting Sperner system on [n] has at most ( n d(n+1)/2e ) sets. Katona [1] gave a simple proof of Milner’s theorem using the cycle...

متن کامل

Morphisms for resistive electrical networks

This paper presents a notion of morphism for resistive electrical networks. It is obvious that symmetries of a resistive network are (trivial) morphisms and easy to show that they induce a nontrivial quotient (their symmetrizer). We extend this result to arbitrary RESNET morphisms having a common domain (called the pushout in category theory). Our principle application of RESNET morphisms is to...

متن کامل

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


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

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011