✦ LIBER ✦

On counting Sperner families

✍ Scribed by Raymond Balbes

Publisher: Elsevier Science
Year: 1979
Tongue: English
Weight: 405 KB
Volume: 27
Category: Article
ISSN: 0097-3165
DOI: 10.1016/0097-3165(79)90002-5

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Some results on sperner families

✍ C Greene; A.J.W Hilton 📂 Article 📅 1979 🏛 Elsevier Science 🌐 English ⚖ 414 KB

Sperner families over a subset

✍ Ko-Wei Lih 📂 Article 📅 1980 🏛 Elsevier Science 🌐 English ⚖ 254 KB

Polytopes determined by complementfree S

Polytopes determined by complementfree Sperner families

✍ Konrad Engel; Peter L. Erdős 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 272 KB

The profile of a family of subsets of an n-element set is a vector f = (f,, , f,), where fk denotes the number of k-element sets in the family. Using a new method the extreme points of the convex hull of the profiles of all complementfree Sperner families over an n-element set are determined.

Sperner families of bounded VC-dimension

✍ R.P. Anstee; A. Sali 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 344 KB

We explore a problem of Frankl (1989). A family ~ of subsets of {1, 2, ..., m} is said to have trace Kk if there is a subset SC\_{1,2 ..... m} with IS] = k so that {FNSIF C .~} yields all 2 k possible subsets. Frankl (1989) conjectured that a family ~ which is an antichain (in poser given by C\_ ord

All maximum 2-part Sperner families

✍ Péter L. Erdös; G.O.H. Katona 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 473 KB

On the structure of maximum 2-part Spern

On the structure of maximum 2-part Sperner families

✍ Shahriar Shahriari 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 479 KB

Color the elements of a finite set S with two colors. A collection of subsets of S is called a 2-part Sperner family if whenever for two distinct sets A and B in this collection we have A c B then B -A has elements of S of both colors. All 2-part Sperner families of maximum size were characterized i