𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Bernstein sets and κ -coverings

✍ Scribed by Jan Kraszewski; Robert Rałowski; Przemysław Szczepaniak; Szymon Żeberski

Publisher
John Wiley and Sons
Year
2010
Tongue
English
Weight
145 KB
Volume
56
Category
Article
ISSN
0044-3050

No coin nor oath required. For personal study only.

✦ Synopsis

In this paper we study a notion of a κ-covering set in connection with Bernstein sets and other types of nonmeasurability. Our results correspond to those obtained by Muthuvel in [7] and Nowik in [8]. We consider also other types of coverings.

📜 SIMILAR VOLUMES

Large sets of coverings
Large sets of coverings
✍ Tuvi Etzion 📂 Article 📅 1994 🏛 John Wiley and Sons 🌐 English ⚖ 699 KB

Large sets of packings were investigated extensively. Much less is known about the dual problem, Le., large sets of coverings. We examine two types of important questions in this context; what is the maximum number of disjoint optimal coverings? and what is the minimum number of optimal coverings fo

New coverings of t-sets with (t + 1)-set
New coverings of t-sets with (t + 1)-sets
✍ Kari J. Nurmela; Patric R. J. Östergård 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 434 KB 👁 1 views

The minimum number of k-subsets out of a v-set such that each t-set is contained in at least one k-set is denoted by C(v, k, t). In this article, a computer search for finding good such covering designs, leading to new upper bounds on C(v, k, t), is considered. The search is facilitated by predeterm

Entropy and set covering
Entropy and set covering
✍ L.P. Lefkovitch 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 755 KB
Existence of large sets of coverings wit
Existence of large sets of coverings with block size 3
✍ L. Ji 📂 Article 📅 2006 🏛 John Wiley and Sons 🌐 English ⚖ 84 KB 👁 1 views

## Abstract Two types of large sets of coverings were introduced by T. Etzion (J Combin Designs, 2(1994), 359–374). What is maximum number (denoted by λ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) coverings? What is the minimum number (denoted by µ(__n,k__)) of disjoint optimal (__n,k,k__ − 1) co

The multi-integer set cover and the faci
The multi-integer set cover and the facility terminal cover problem
✍ Dorit S. Hochbaum; Asaf Levin 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 86 KB

## Abstract The facility terminal cover problem is a generalization of the vertex cover problem. The problem is to “cover” the edges of an undirected graph __G__ = (__V__,__E__) where each edge __e__ is associated with a non‐negative demand __d__~__e__~. An edge __e__ = __u__,__v__ is covered if at