IBM - Personal communication

This web page contains the abstract of my paper:

"A New Construction for Cancellative Families of Sets", The Electronic Journal of Combinatorics, 3(1996), #R15.

Abstract: Following [2], we say a family, H, of subsets of a n-element set is cancellative if (A union B) = (A union C) implies B=C when A,B,C are members of H. We show how to construct cancellative families of sets with c*2**(.54797*n) elements. This improves the previous best bound c*2**(.52832*n) and falsifies conjectures of Erdos and Katona [3] and Bollobas [1].

[ IBM Research home page | James B. Shearer's home page | Up ]
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]