The packing of pairs by quadruples
β Scribed by Ahmed M. Assaf
- Publisher
- Elsevier Science
- Year
- 1991
- Tongue
- English
- Weight
- 601 KB
- Volume
- 90
- Category
- Article
- ISSN
- 0012-365X
No coin nor oath required. For personal study only.
β¦ Synopsis
Assaf, A.M., The packing of pairs by quadruples, Discrete Mathematics 90 (1991) 221-231 Let X be a finite set of size v, further let 1 be a positive integer and let ~(4, n;v) denote the maximum number of quadruples such that each pair of elements of X is contained in at most A of them. The value of ~(4, 1;~) has been determined by Brouwer (1979) for all vS4. The value of ~(4, &v) has been determined
by Billington, Stanton and Stinson (1984) for all v -0 (mod 3) and A > 1. In this paper we complete the determination of ~(4, I.;v) for all v 2 4 and A>l.
π SIMILAR VOLUMES
## 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
A (v, k, 1) packing design of order v, block size k, and index 1 is a collection of k-element subsets, called blocks, of a u-set, V, such that every 2-subset of V occurs in at most I blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we provid
Ponomarev [4] although the first section of [4] is recommended since it motivates the study of quadruples.
Minkowski space M d =(R d , || ||) is just R d with distances measured using a norm || ||. A norm || || is completely determined by its unit ball {x Β₯ R d | ||x|| [ 1} which is a centrally symmetric convex body of the d-dimensional Euclidean space E d . In this note we give upper bounds for the maxi