We use a lower bound on the number of small sets in an idea1 to show that for each unionclosed family of n sets there exists an element which belongs to at least of them, provided n is large enough.
Families of planar sets having starlike union
β Scribed by Marilyn Breen
- Publisher
- Springer
- Year
- 1999
- Tongue
- English
- Weight
- 214 KB
- Volume
- 65
- Category
- Article
- ISSN
- 0047-2468
No coin nor oath required. For personal study only.
π SIMILAR VOLUMES
A family of sets has the equal union property if there exist two nonempty disjoint subfamilies having equal unions and has the full equal union property if, in addition, all sets are included. Both recognition problems are NP-complete even when restricted to families for which the cardinality of eve
In 1964, Kautz and Singleton (IEEE Trans. Inform. Theory 10 (1964), 363-377) introduced the superimposed code concept. A binary superimposed code of strength s is identified by the incidence matrix of a family of finite sets in which no set is covered by the union of s others (
We present a conjecture, with some supporting results, concerning the maximum size of a family of subsets satisfying the following conditions: the intersection of any two members of the family has cardinal@ at least s, and the intersection of the complements of any two members has cardinal@ at least