๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Maximum antichains of rectangular arrays

โœ Scribed by G.W Peck

Book ID
103508245
Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
225 KB
Volume
27
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Maximum antichains in the product of cha
Maximum antichains in the product of chains
โœ Jerrold R. Griggs ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Springer Netherlands ๐ŸŒ English โš– 433 KB

Let P be the poset k, x ~~~xk,,whichisaproductofchains,wheren>landk, >+a.> kn > 2. Let M = k, -8yT=z(kt -1). P is known to have the Sperner property, which means that its maximum ranks are maximum antichains. Here we prove that its maximum ranks are its only maximum antichains if and only if either

Maximum Antichains in Random Subsets of
Maximum Antichains in Random Subsets of a Finite Set
โœ Deryk Osthus ๐Ÿ“‚ Article ๐Ÿ“… 2000 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 125 KB

We consider the random poset P(n, p) which is generated by first selecting each subset of [n]=[1, ..., n] with probability p and then ordering the selected subsets by inclusion. We give asymptotic estimates of the size of the maximum antichain for arbitrary p= p(n). In particular, we prove that if p

Transversals in Rectangular Arrays
Transversals in Rectangular Arrays
โœ Sherman Stein ๐Ÿ“‚ Article ๐Ÿ“… 2010 ๐Ÿ› Mathematical Association of America ๐ŸŒ English โš– 178 KB