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

Some results on sperner families

โœ Scribed by C Greene; A.J.W Hilton

Publisher
Elsevier Science
Year
1979
Tongue
English
Weight
414 KB
Volume
26
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

On counting Sperner families
On counting Sperner families
โœ Raymond Balbes ๐Ÿ“‚ Article ๐Ÿ“… 1979 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 405 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

Some results on the complexity of famili
Some results on the complexity of families of sets
โœ Daniel Grieser ๐Ÿ“‚ Article ๐Ÿ“… 1991 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 872 KB

Grieser, D., Some results on the complexity of families of sets, Discrete Mathematics 88 (1991) 179-192. Let 'Y be a property of graphs on a fixed n-element vertex set V. The complexity c(P) is the minimal number of edges whose existence in a previously unknown graph H has to be tested such that it