On small packing and covering designs with block size 4

Alan Hartman

doi:10.1016/0012-365X(86)90174-3

On small packing and covering designs with block size 4

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

Abstract

A packing (respectively covering) 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 (at least) λ blocks. The packing (covering) problem is to determine the maximum (minimum) number of blocks in a packing (covering) design. Motivated by the recent work of Assaf [1] [2], we solve the outstanding packing and covering problems with block size 4.

Original language	English
Pages (from-to)	275-281
Number of pages	7
Journal	Discrete Mathematics
Volume	59
Issue number	3
DOIs	https://doi.org/10.1016/0012-365X(86)90174-3
State	Published - May 1986
Externally published	Yes

ASJC Scopus subject areas

Theoretical Computer Science
Discrete Mathematics and Combinatorics

Access to Document

10.1016/0012-365X(86)90174-3

Cite this

@article{8df9e3a0112a40059c5296fcb361967b,

title = "On small packing and covering designs with block size 4",

abstract = "A packing (respectively covering) 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 (at least) λ blocks. The packing (covering) problem is to determine the maximum (minimum) number of blocks in a packing (covering) design. Motivated by the recent work of Assaf [1] [2], we solve the outstanding packing and covering problems with block size 4.",

author = "Alan Hartman",

year = "1986",

month = may,

doi = "10.1016/0012-365X(86)90174-3",

language = "English",

volume = "59",

pages = "275--281",

journal = "Discrete Mathematics",

issn = "0012-365X",

publisher = "Elsevier",

number = "3",

}

TY - JOUR

T1 - On small packing and covering designs with block size 4

AU - Hartman, Alan

PY - 1986/5

Y1 - 1986/5

N2 - A packing (respectively covering) 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 (at least) λ blocks. The packing (covering) problem is to determine the maximum (minimum) number of blocks in a packing (covering) design. Motivated by the recent work of Assaf [1] [2], we solve the outstanding packing and covering problems with block size 4.

AB - A packing (respectively covering) 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 (at least) λ blocks. The packing (covering) problem is to determine the maximum (minimum) number of blocks in a packing (covering) design. Motivated by the recent work of Assaf [1] [2], we solve the outstanding packing and covering problems with block size 4.

UR - https://www.scopus.com/pages/publications/38249040067

U2 - 10.1016/0012-365X(86)90174-3

DO - 10.1016/0012-365X(86)90174-3

M3 - Article

AN - SCOPUS:38249040067

SN - 0012-365X

VL - 59

SP - 275

EP - 281

JO - Discrete Mathematics

JF - Discrete Mathematics

IS - 3

ER -

On small packing and covering designs with block size 4

Abstract

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this