𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Completely separating systems of k-sets

✍ Scribed by Colin Ramsay; Ian T. Roberts; Frank Ruskey

Book ID
104113891
Publisher
Elsevier Science
Year
1998
Tongue
English
Weight
506 KB
Volume
183
Category
Article
ISSN
0012-365X

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

Minimal Completely Separating Systems of
Minimal Completely Separating Systems of k-Sets
✍ AndrΓ© KΓΌndgen; Dhruv Mubayi; Prasad Tetali πŸ“‚ Article πŸ“… 2001 πŸ› Elsevier Science 🌐 English βš– 117 KB

Let n and k be fixed positive integers. A collection C of k-sets of [n] is a completely separating system if, for all distinct i, j # [n], there is an S # C for which i # S and j Γ‚ S. Let R(n, k) denote the minimum size of such a C. Our results include showing that if n k is a sequence with k< 0, th

On separating systems whose elements are
On separating systems whose elements are sets of at most k elements
✍ Ingo Wegener πŸ“‚ Article πŸ“… 1979 πŸ› Elsevier Science 🌐 English βš– 423 KB

A system A,, . . . , A,,, of subsets of X := (1,. . . , n} is called a separating system if for any two distinct elements of X there is a set Ai (1 G i em) that contains exactly one of the two elements. We investigate separating systems where each set Ai has at most k elements and we are looking for