𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal Completely Separating Systems of k-Sets

✍ Scribed by André Kündgen; Dhruv Mubayi; Prasad Tetali

Publisher
Elsevier Science
Year
2001
Tongue
English
Weight
117 KB
Volume
93
Category
Article
ISSN
0097-3165

No coin nor oath required. For personal study only.

✦ Synopsis

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, then R(n k , k)tmin { t: n k \ t WktÂn k X+= .

📜 SIMILAR VOLUMES

A complete solution to the existence pro
A complete solution to the existence problem for 1-rotational k-cycle systems of Kv
✍ Shung-Liang Wu; Marco Buratti 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 133 KB 👁 1 views

## Abstract The necessary and sufficient conditions for the existence of a 1‐rotational __k__‐cycle system of the complete graph __K__~__v__~ are established. The proof provides an algorithm able to determine, directly and explicitly, an odd __k__‐cycle system of __K__~__v__~ whenever such a system

An affine design with v = m2h and k = m2
An affine design with v = m2h and k = m2h−1 not equivalent to a complete set of F(mh; mh−1) MOFS
✍ Charles F. Laywine 📂 Article 📅 1999 🏛 John Wiley and Sons 🌐 English ⚖ 165 KB

Existing sufficient conditions for the construction of a complete set of mutually orthogonal frequency squares from an affine resolvable design are improved to give necessary and sufficient conditions. In doing so a design is exhibited that proves that the class of complete sets of MOFS under consid