𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Families of chains of a poset and Sperner properties

✍ Scribed by Bruno Leclerc


Publisher
Elsevier Science
Year
1997
Tongue
English
Weight
626 KB
Volume
165-166
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


A subset A of a poset P is a q-anti&in if it can be obtained as the union of at most q antichains. A ranked poset P is said to be q-Sperner if the maximum number of elements of a q-antichain of P is the sum of the cardinalities of its q larger rank-sets. P is strongly Spernu if it is q-Sperner for all q. A necessary and sufficient condition for P being q-Sperner is given. in terms of the existence of a family of maxima1 chains with specified properties. Unified proofs of several conditions of the literature for a poset to be strongly Sperner are derived.

Une partie A d'un ensemble ordonni: P est une q-antichaine si elle s'obtient commc union d'au plus q antichaines. Un ensemble ordonni: rang& P est dit q-Sperner si le cardinal maximum d'une q-antichaine de P est Cgal g la somme des cardinaux de ses q plus grands niveaux, et ,fortement de Sperner s'il est q-Sperner pour tout q. On donne une condition ntcessaire et suffisante pour que P soit q-Sperner, par I'existence d'une famille de chaines maximales vtrifiant certaines propriCt&s. On en tire des dCmonstrations unifikes pour un certain nombre de conditions de la litttrature assurant qu'un ensemble ordonni: est fortement de Sperner.


πŸ“œ SIMILAR VOLUMES


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