Geodesic
A new construction for cancellative families of sets
The electronic journal of combinatorics, Tome 3 (1996) no. 1
Cet article a éte moissonné depuis la source The Electronic Journal of Combinatorics website

Voir la notice de l'article

Following [2], we say a family, $H$, of subsets of a $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 $c 2^{.54797n}$ elements. This improves the previous best bound $c 2^{.52832n}$ and falsifies conjectures of Erdös and Katona [3] and Bollobás [1].
DOI : 10.37236/1239
Classification : 05D05
Mots-clés : cancellative families 
@article{10_37236_1239,
     author = {James B. Shearer},
     title = {A new construction for cancellative families of sets},
     journal = {The electronic journal of combinatorics},
     year = {1996},
     volume = {3},
     number = {1},
     doi = {10.37236/1239},
     zbl = {0851.05092},
     url = {http://geodesic.mathdoc.fr/articles/10.37236/1239/}
}
TY  - JOUR
AU  - James B. Shearer
TI  - A new construction for cancellative families of sets
JO  - The electronic journal of combinatorics
PY  - 1996
VL  - 3
IS  - 1
UR  - http://geodesic.mathdoc.fr/articles/10.37236/1239/
DO  - 10.37236/1239
ID  - 10_37236_1239
ER  - 
%0 Journal Article
%A James B. Shearer
%T A new construction for cancellative families of sets
%J The electronic journal of combinatorics
%D 1996
%V 3
%N 1
%U http://geodesic.mathdoc.fr/articles/10.37236/1239/
%R 10.37236/1239
%F 10_37236_1239
James B. Shearer. A new construction for cancellative families of sets. The electronic journal of combinatorics, Tome 3 (1996) no. 1. doi: 10.37236/1239

Cité par Sources :