𝔖 Bobbio Scriptorium
✦   LIBER   ✦

The maximal length of cloud-antichains

✍ Scribed by Rudolf Ahlswede; Levon H. Khachatrian


Publisher
Elsevier Science
Year
1994
Tongue
English
Weight
365 KB
Volume
131
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

✦ Synopsis


For six natural notions of cloud-antichains in a partially ordered set .Y we determine asymptotically their maximal lengths if 9 is the family of all subsets of a finite set. Actually, in three cases we even have exact results.


πŸ“œ SIMILAR VOLUMES


A splitting property of maximal antichai
✍ Rudolf Ahlswede; PΓ©ter L. ErdΕ‘s; Niall Graham πŸ“‚ Article πŸ“… 1995 πŸ› Springer-Verlag 🌐 English βš– 290 KB
An application of dilworth's lattice of
✍ Ralph Freese πŸ“‚ Article πŸ“… 1974 πŸ› Elsevier Science 🌐 English βš– 113 KB

Recently there has been a good deal of interest m the maximal sized antichains of a partially ordered set [ 1-8] A theorem of Dtlworth states that under the natural ordering these antlchams form a distributive lattice. This paper outhnes a proof of this theorem and apphes it to strengthen the result

Products of chains with monochromatic ma
✍ D. Duffus; T. Goddard πŸ“‚ Article πŸ“… 1996 πŸ› Springer Netherlands 🌐 English βš– 996 KB

There is a product of two linear orders of size 2nn with the property that every subset or complement thereof contains a maximal chain. Furthermore, for regular l&, there is a product of two linear orders of size t&+2 that when colored with fewer than & colors always has a monochromatic maximal chai