This web page contains the abstract of my paper:
"Intersections of k-element Sets" with D.J. Kleitman and D. Sturtevant, Combinatorica, 1(1981), p. 381-384.
Abstract: Let F be a collection of k-element sets with the property that the intersection of no two should be included in a third. We show that such a collection of maximum size satisfies .2715*k+o(k)<=log2|F| <=.7549*k+o(k) settling a question raised by Erdos. The lower bound is probabilistic, the upper bound is deduced via an entropy argument. Some open questions are posed.
IBM Research home page |
James B. Shearer's home page |
[ IBM home page | Order | Search | Contact IBM | Help | (C) | (TM) ]