Abstract
A collection F of sets is k-independent if for any selections A, B of k1 and k2 of its members with k1+k2=k, there are elements in all the members of A and not in the members of B. Bounds on the maximal size of k-independent families exponential in the total number of elements are obtained.
Original language | English (US) |
---|---|
Pages (from-to) | 255-262 |
Number of pages | 8 |
Journal | Discrete Mathematics |
Volume | 6 |
Issue number | 3 |
DOIs | |
State | Published - 1973 |
ASJC Scopus subject areas
- Theoretical Computer Science
- Discrete Mathematics and Combinatorics