𝔖 Bobbio Scriptorium
✦   LIBER   ✦

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


Union-closed families of sets
✍ Piotr WΓ³jcik πŸ“‚ Article πŸ“… 1999 πŸ› Elsevier Science 🌐 English βš– 532 KB

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 sets having property B
✍ N. H. Williams πŸ“‚ Article πŸ“… 1981 πŸ› Springer Netherlands 🌐 English βš– 618 KB
Complexity of Recognizing Equal Unions i
✍ David P. Jacobs; Robert E. Jamison πŸ“‚ Article πŸ“… 2000 πŸ› Elsevier Science 🌐 English βš– 87 KB

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

Families of Finite Sets in which No Inte
✍ A. D'yachkov; P. Vilenkin; D. Torney; A. Macula πŸ“‚ Article πŸ“… 2002 πŸ› Elsevier Science 🌐 English βš– 216 KB

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 (

On families of finite sets with bounds o
✍ Chang Bang; Henry Sharp Jr.; Peter Winkler πŸ“‚ Article πŸ“… 1983 πŸ› Elsevier Science 🌐 English βš– 364 KB

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