𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Minimal coverings and maximal packings of (k−1)-subsets by k-subsets

✍ Scribed by N. N. Kuzyurin


Publisher
SP MAIK Nauka/Interperiodica
Year
1977
Tongue
English
Weight
227 KB
Volume
21
Category
Article
ISSN
0001-4346

No coin nor oath required. For personal study only.


📜 SIMILAR VOLUMES


Maximal resolvable packings and minimal
✍ Xiande Zhang; Gennian Ge 📂 Article 📅 2009 🏛 John Wiley and Sons 🌐 English ⚖ 160 KB

## Abstract Determination of maximal resolvable packing number and minimal resolvable covering number is a fundamental problem in designs theory. In this article, we investigate the existence of maximal resolvable packings of triples by quadruples of order __v__ (MRPQS(__v__)) and minimal resolvabl

Packings and coverings of λKv by k-circu
✍ Qingde Kang; Yanfang Zhang; Huijuan Zuo 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 322 KB

Let Kv be the complete multigraph with v vertices, where any two distinct vertices x and y are joined by edges {x; y}. Let G be a ÿnite simple graph. A G-packing design (G-covering design) of Kv, denoted by (v; G; )-PD ((v; G; )-CD) is a pair (X; B), where X is the vertex set of Kv and B is a collec