A new construction for cancellative families of sets (Q1918871): Difference between revisions
From MaRDI portal
Created a new Item |
Added link to MaRDI item. |
||
| links / mardi / name | links / mardi / name | ||
Revision as of 14:43, 1 February 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A new construction for cancellative families of sets |
scientific article |
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
