On packing designs with block size 5 and index 4

Ahmed M. Assaf; Alan Hartman

doi:10.1016/0012-365X(90)90027-F

On packing designs with block size 5 and index 4

Ahmed M. Assaf, Alan Hartman

Research output: Contribution to journal › Article › peer-review

Abstract

A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with k=5, λ=4, and all positive integers v.

Original language	English
Pages (from-to)	111-121
Number of pages	11
Journal	Discrete Mathematics
Volume	79
Issue number	2
DOIs	https://doi.org/10.1016/0012-365X(90)90027-F
State	Published - 15 Jan 1990
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(90)90027-F

Cite this

@article{66d986d4950549599ed7bded9ecc1ed7,

title = "On packing designs with block size 5 and index 4",

abstract = "A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with k=5, λ=4, and all positive integers v.",

author = "Assaf, {Ahmed M.} and Alan Hartman",

year = "1990",

month = jan,

day = "15",

doi = "10.1016/0012-365X(90)90027-F",

language = "English",

volume = "79",

pages = "111--121",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "2",

}

TY - JOUR

T1 - On packing designs with block size 5 and index 4

AU - Assaf, Ahmed M.

AU - Hartman, Alan

PY - 1990/1/15

Y1 - 1990/1/15

N2 - A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with k=5, λ=4, and all positive integers v.

AB - A (v,k,λ) packing design of order v, block size k, and index λ is a collection of k-element subsets, called blocks, of a v-set, V, such that every 2-subset of V occurs in at most λ blocks. The packing problem is to determine the maximum number of blocks in a packing design. In this paper we solve the packing problem with k=5, λ=4, and all positive integers v.

UR - http://www.scopus.com/inward/record.url?scp=38249019875&partnerID=8YFLogxK

U2 - 10.1016/0012-365X(90)90027-F

DO - 10.1016/0012-365X(90)90027-F

M3 - Article

AN - SCOPUS:38249019875

SN - 0012-365X

VL - 79

SP - 111

EP - 121

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 2

ER -

On packing designs with block size 5 and index 4

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this