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

A minimization problem concerning subsets of a finite set

โœ Scribed by G.F. Clements


Publisher
Elsevier Science
Year
1973
Tongue
English
Weight
208 KB
Volume
4
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.


๐Ÿ“œ SIMILAR VOLUMES


Extremal problems among subsets of a set
โœ Paul Erdos; Daniel J. Kleitman ๐Ÿ“‚ Article ๐Ÿ“… 1974 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 945 KB
Maximum Antichains in Random Subsets of
โœ 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

On the minimal cofinal subsets of a dire
โœ Wang Shang-Zhi; Li Bo-Yu ๐Ÿ“‚ Article ๐Ÿ“… 1984 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 818 KB

It is shown that for any directed quasi-ordered set (Q, ~<), there is a minimal ordinal number h such that every cofinal subset of Q contains a cofinal subset which is the 0-th class original set of a pure h-th class chain of Q. A special case of our results gives necessary and sufficient conditions

A Ramsey theoretic problem for finite or
โœ H.A. Kierstead; W.T. Trotter ๐Ÿ“‚ Article ๐Ÿ“… 1987 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 467 KB

In this paper, we consider the following Ramsey theoretic problem for finite ordered sets: For each II 3 1, what is the least integer f(n) so that for every ordered set P of width it, there exists an ordered set Q of width f(n) such that every 2-coloring of the points of Q produces a monochromatic