A new construction for cancellative families of sets (Q1918871)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 907636
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | A new construction for cancellative families of sets |
scientific article; zbMATH DE number 907636 |
Statements
A new construction for cancellative families of sets (English)
0 references
21 July 1996
0 references
Summary: We say a family, \(H\), of subsets of an \(n\)-element set is cancellative if \(A\cup B= A\cup C\) implies \(B= C\) when \(A, B, C\in H\). We show how to construct cancellative families of sets with \(c2^{.54797n}\) elements. This improves the previous best bound \(c2^{.52832n}\) and falsifies conjectures of Erdös and Katona and of Bollobás.
0 references
cancellative families
0 references
0 references
0 references
0.87382597
0 references
0.8596844
0 references
0 references
0.8523469
0 references
0.8487159
0 references
