Abstract
A family of subsets of an n-set is k-locally thin if, for every k of its member sets, the ground set has at least one element contained in exactly 1 of them. We derive new asymptotic upper bounds for the maximum cardinality of locally thin set families for every even k. This improves on previous results of two of the authors with Monti.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 481-488 |
| Number of pages | 8 |
| Journal | Combinatorics Probability and Computing |
| Volume | 9 |
| Issue number | 6 |
| DOIs | |
| State | Published - 2000 |
| Externally published | Yes |
All Science Journal Classification (ASJC) codes
- Theoretical Computer Science
- Statistics and Probability
- Computational Theory and Mathematics
- Applied Mathematics